On 2-factor Hamiltonian regular bipartite graphs
From MaRDI portal
\textit{M. Funk} et al. [J. Comb. Theory, Ser. B 87, No. 1, 138--144 (2003; Zbl 1045.05061)] proved that if each \(2\)-factor of a \(k\)-regular bipartite graph is Hamiltonian then \(k\leq 3\). In this paper a new proof of this claim is provided.
Recommendations
- On Hamiltonian bipartite graphs
- Hamilton cycles in 2-connected regular bipartite graphs
- On regular 2-connected 2-path Hamiltonian graphs
- Hamilton cycle rich 2-factorization of complete bipartite graphs
- scientific article; zbMATH DE number 908781
- scientific article; zbMATH DE number 2192128
- scientific article; zbMATH DE number 140139
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- On 2-factors of a bipartite graph
- 2-factors with \(k\) cycles in Hamiltonian graphs
Cites work
Cited in
(6)- 2-factor Hamiltonian graphs.
- 2-factors and Hamiltonicity
- Regular bipartite graphs with all 2-factors isomorphic
- Pseudo 2-factor isomorphic regular bipartite graphs
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- scientific article; zbMATH DE number 5130728 (Why is no real title available?)
This page was built for publication: On 2-factor Hamiltonian regular bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250805)
