Uniquely bi-embeddable bipartite 2-regular graphs
A bipartite 2-regular graph is a bipartite graph \(G\) such that \(G = C_{2n_{1}} \cup C_{2n_{2}} \cup \cdots \cup C_{2n_{k}}\) with \(k \geq 1\), i.e., \(G\) is a vertex-disjoint union of bipartite cycles. In this paper, we completely characterize the bipartite 2-regular graphs which can be uniquely bi-embedded into their bipartite complements.
Authors
- Hong Wang (ORCID: https://orcid.org/0000-0003-0803-1111)
- Jiayu Yang (ORCID: https://orcid.org/0009-0003-8217-4396)
Institutions
- University of Idaho (US)
Publication Details
- Journal
- Cubo
- Published
- 2026-11-04
- DOI
- https://doi.org/10.56754/0719-0646.2901.007
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00