A planar hypohamiltonian graph with 48 vertices

DOI10.1002/jgt.20241zbMath1120.05054OpenAlexW4244752224WikidataQ56001743 ScholiaQ56001743MaRDI QIDQ3594955

Carol T. Zamfirescu, Tudor I. Zamfirescu

Publication date: 9 August 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20241

zbMATH Keywords

graphplanarhypotraceablehypohamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Forbidden configurations for hypohamiltonian graphs ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Planar lattice graphs with Gallai's property ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ Improved bounds for hypohamiltonian graphs ⋮ On planar hypohamiltonian graphs ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs

Cites Work

• Planar cubic hypohamiltonian and hypotraceable graphs
• A two-connected planar graph without concurrent longest paths
• On longest paths and circuits in graphs.

This page was built for publication: A planar hypohamiltonian graph with 48 vertices