Infinitely many hypohamiltonian cubic graphs of girth 7
From MaRDI portal
Publication:659692
DOI10.1007/S00373-010-0968-ZzbMATH Open1235.05085OpenAlexW1997486546MaRDI QIDQ659692FDOQ659692
Authors: E. 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
Recommendations
Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63) Structural characterization of families of graphs (05C75)
Cites Work
- Snarks without small cycles
- Title not available (Why is that?)
- The classification of Hamiltonian generalized Petersen graphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Title not available (Why is that?)
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
Cited In (12)
- Atoms of cyclic edge connectivity in regular graphs
- Gallai's property for graphs in lattices on the torus and the Möbius strip
- Superposition of snarks revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Super-cyclically edge-connected regular graphs
- On hypohamiltonian and almost hypohamiltonian graphs
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5
- Snarks, hypohamiltonian graphs and non-supereulerian graphs
- Structural and computational results on platypus graphs
- Infinitely many planar cubic hypohamiltonian graphs of girth 5
- Improved bounds for hypo-Hamiltonian graphs
This page was built for publication: Infinitely many hypohamiltonian cubic graphs of girth 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659692)
