Minimal \(k\)-connected non-Hamiltonian graphs
From MaRDI portal
Publication:1743684
DOI10.1007/s00373-018-1874-zzbMath1405.05095OpenAlexW2793974272MaRDI QIDQ1743684
Publication date: 13 April 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1874-z
Related Items (2)
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs ⋮ Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
Cites Work
- Unnamed Item
- Decomposition of regular matroids
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- Graph minors. IX: Disjoint crossed paths
- The circumference of a graph with no \(K_{3,t}\)-minor. II
- A note on Hamiltonian circuits
- A Theorem on Planar Graphs
- Construction of planar 4-connected triangulations
- Hamiltonicity of planar graphs with a forbidden minor
- Hamilton cycles in plane triangulations
This page was built for publication: Minimal \(k\)-connected non-Hamiltonian graphs