Non-Hamiltonian bicubic graphs

DOI10.1016/0095-8956(89)90012-9zbMath0673.05061OpenAlexW2060787934WikidataQ56001793 ScholiaQ56001793MaRDI QIDQ1120592

John P. Georges

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90012-9

zbMATH Keywords

bipartite3-regularbicubic graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Cuts in matchings of 3-connected cubic graphs ⋮ The minimality of the Georges–Kelmans graph ⋮ Relating edge-coverings to the classification of \(\mathbb Z^k_2\)-magic graphs ⋮ A note on graphs contraction-critical with respect to independence number ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ A note on the smallest connected non-traceable cubic bipartite planar graph ⋮ Matching theory and Barnette's conjecture

Cites Work

• Unnamed Item
• Non-Hamiltonian 3-connected cubic bipartite graphs
• On two-factors of bipartite regular graphs
• Cycles through ten vertices in 3-connected cubic graphs
• On the 2-factors of bicubic graphs

This page was built for publication: Non-Hamiltonian bicubic graphs