The entire graph of a bridgeless connected plane graph is Hamiltonian

DOI10.1016/0012-365X(76)90101-1zbMath0344.05134MaRDI QIDQ1232422

John Mitchem, Arthur M. Hobbs

Publication date: 1976

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Edge-pancyclicity of coupled graphs ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ The square of a block is vertex pancyclic

Cites Work

• The square of a block is vertex pancyclic
• Parallel concepts in graph theory
• The square of a block is Hamiltonian connected
• The square of every two-connected graph is Hamiltonian
• A correction to: On the algebraic theory of graph colorings
• Minimally 2-connected graphs.
• Unnamed Item
• Unnamed Item

This page was built for publication: The entire graph of a bridgeless connected plane graph is Hamiltonian