Three small cubic graphs with interesting hamiltonian properties

DOI10.1002/JGT.3190040306zbMATH Open0442.05047OpenAlexW2132392028MaRDI QIDQ3884142FDOQ3884142

Authors: Tudor 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• 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
• Small \(k\)-pyramids and the complexity of determining \(k\)
• Spanning trees with nonseparating paths

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

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