Non-Hamiltonian 3-connected cubic bipartite graphs

DOI10.1016/0095-8956(83)90046-1zbMath0516.05033OpenAlexW2015468112WikidataQ55954090 ScholiaQ55954090MaRDI QIDQ1052335

J. D. Horton, Mark N. Ellingham

Publication date: 1983

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(83)90046-1

zbMATH Keywords

cyclically 4-edge-connectedbicubic graphnon-hamiltonian

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Bipartite regular graphs and shortness parameters ⋮ Regular Graphs with Few Longest Cycles ⋮ The minimality of the Georges–Kelmans graph ⋮ On line graphs of subcubic triangle-free graphs ⋮ Non-Hamiltonian bicubic graphs ⋮ On a problem of J. Csima ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs ⋮ Connected \(k\)-factors in bipartite graphs ⋮ Hamiltonian cycles in cubic 3-connected bipartite planar graphs

Cites Work

• Unnamed Item
• 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 3-connected cubic bipartite graphs