A planar hypohamiltonian graph with 48 vertices

DOI10.1002/JGT.20241MaRDI QIDQ3594955zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Carol T. Zamfirescu, Tudor 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

graphhypohamiltonianhypotraceableplanar

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites work

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

Cited in

(9)

• Gallai's question and constructions of almost hypotraceable graphs
• Planar Hypohamiltonian Graphs on 40 Vertices
• On planar hypohamiltonian graphs
• Planar lattice graphs with Gallai's property
• Forbidden configurations for hypohamiltonian graphs
• Every 4-connected graph with crossing number 2 is Hamiltonian
• Improved bounds for hypo-Hamiltonian graphs
• On hypohamiltonian and almost hypohamiltonian graphs
• Small planar Hypohamiltonian graphs

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

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