Infinitely many hypohamiltonian cubic graphs of girth 7

DOI10.1007/s00373-010-0968-zzbMath1235.05085OpenAlexW1997486546MaRDI QIDQ659692

Edita Máčajová, Martin Škoviera

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0968-z

zbMATH Keywords

girthcyclic connectivityhypohamiltonian cubic graphinfinite familytrivalent Coxeter graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)

Related Items

Super cyclically edge-connected vertex-transitive graphs of girth at least 5, Super-cyclically edge-connected regular graphs, Gallai's property for graphs in lattices on the torus and the Möbius strip, Structural and computational results on platypus graphs, Improved bounds for hypohamiltonian graphs, Superposition of snarks revisited, Snarks, hypohamiltonian graphs and non-supereulerian graphs, Atoms of cyclic edge connectivity in regular graphs, On Hypohamiltonian and Almost Hypohamiltonian Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• The classification of Hamiltonian generalized Petersen graphs
• Snarks without small cycles