Three small cubic graphs with interesting hamiltonian properties

DOI10.1002/jgt.3190040306zbMath0442.05047OpenAlexW2132392028MaRDI QIDQ3884142

Tudor I. Zamfirescu

Publication date: 1980

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

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

zbMATH Keywords

non-traceablecubic 3-connected planar graphcubic one-Hamiltonian graphnot Hamiltonian-connectednot homogeneously traceable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Spanning trees with nonseparating paths ⋮ Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ A note on the smallest connected non-traceable cubic bipartite planar graph ⋮ On the minimum leaf number of cubic graphs ⋮ Regular non-Hamiltonian polyhedral graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three small cubic graphs with interesting hamiltonian properties