Non-Hamiltonian cubic planar maps

DOI10.1016/S0012-365X(74)80019-1zbMATH Open0271.05106MaRDI QIDQ759157FDOQ759157

Authors: G. B. Faulkner, Daniel H. Younger 

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Title not available (Why is that?)
• Polytopes, graphs, and complexes
• Hamiltonian circuits on simple 3-polytopes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Title not available (Why is that?)
• Hamiltonian circuits in polytopes with even sided faces
• Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Vertices missed by longest paths or circuits
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Planar cubic hypohamiltonian and hypotraceable graphs
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• Shortness exponents for polytopes which are k-gonal modulo n
• K₂‐Hamiltonian graphs: II
• Hamiltonian cycles in some family of cubic 3-connected plane graphs
• Planar and infinite hypohamiltonian and hypotraceable graphs
• On the circumference of 3-connected cubic triangle-free plane graphs
• Shortness coefficient of cyclically 4-edge-connected cubic graphs
• Shortness coefficient of cyclically 5-connected cubic planar graphs
• Unimodular systems of vectors are embeddable in the \((0, 1)\)-cube
• On cubic polyhedral graphs with prescribed adjacency properties of their faces
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Shortness coefficients of simple 3-polytopal graphs with edges of only two types
• Hamiltonian circuits in simple 3-polytopes with up to 26 vertices
• $K_2$-Hamiltonian Graphs: I

This page was built for publication: Non-Hamiltonian cubic planar maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759157)