Non-Hamiltonian bicubic graphs
From MaRDI portal
Publication:1120592
DOI10.1016/0095-8956(89)90012-9zbMath0673.05061OpenAlexW2060787934WikidataQ56001793 ScholiaQ56001793MaRDI QIDQ1120592
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
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
This page was built for publication: Non-Hamiltonian bicubic graphs