Non-Hamiltonian cubic planar maps
From MaRDI portal
Publication:759157
DOI10.1016/S0012-365X(74)80019-1zbMath0271.05106MaRDI QIDQ759157
G. B. Faulkner, Daniel H. Younger
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices, Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs, On the circumference of 3-connected cubic triangle-free plane graphs, Non-Hamiltonian simple 3-polytopes having just two types of faces, K2‐Hamiltonian graphs: II, Unimodular systems of vectors are embeddable in the \((0, 1)\)-cube, Shortness parameters of families of regular planar graphs in two or three types of faces, Shortness exponents for polytopes which are k-gonal modulo n, Hamiltonian cycles in some family of cubic 3-connected plane graphs, Shortness coefficients of simple 3-polytopal graphs with edges of only two types, Hamiltonian circuits in simple 3-polytopes with up to 26 vertices, Hamiltonian circuits in polytopes with even sided faces, Planar and infinite hypohamiltonian and hypotraceable graphs, Pairs of edge-disjoint Hamiltonian circuits, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Planar cubic hypohamiltonian and hypotraceable graphs, Shortness coefficient of cyclically 4-edge-connected cubic graphs, Vertices missed by longest paths or circuits, Unnamed Item, On cubic polyhedral graphs with prescribed adjacency properties of their faces, Shortness coefficient of cyclically 5-connected cubic planar graphs, $K_2$-Hamiltonian Graphs: I, Simple 3-polytopal graphs with edges of only two types and shortness coefficients, On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
Cites Work
