Ein planarer hypohamiltonscher Graph mit 57 Knoten

DOI10.1007/BF01424541zbMath0396.05032WikidataQ56001742 ScholiaQ56001742MaRDI QIDQ1253261

Wolfgang Hatzel

Publication date: 1979

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/182816

zbMATH Keywords

Planar GraphHypohamiltonian

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Forbidden configurations for hypohamiltonian graphs ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Improved bounds for hypohamiltonian graphs ⋮ On planar hypohamiltonian graphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs

Cites Work

• Unnamed Item
• Planar and infinite 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: Ein planarer hypohamiltonscher Graph mit 57 Knoten