A non-Hamiltonian planar graph
From MaRDI portal
Publication:3286848
Cites work
Cited in
(16)- The asymptotic connectivity of labelled regular graphs
- Submaps of maps. II: Cyclically k-connected planar cubic maps
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Theory of families of polytopes: fullerenes and Pogorelov polytopes
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- The cubic graphs with finite cyclic vertex connectivity larger than girth
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Regular non-Hamiltonian polyhedral graphs
- A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
- Shortness exponents of families of graphs
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- Polytopes, graphs, and complexes
- Circumference of essentially 4-connected planar triangulations
- Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs
- Extremal spectral radius of graphs with cyclic edge-connectivity
- Edge reductions in cyclically \(k\)-connected cubic graphs
This page was built for publication: A non-Hamiltonian planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286848)