Generation and new infinite families of K₂-hypohamiltonian graphs

DOI10.1016/J.DISC.2024.113981MaRDI QIDQ6542014zbMATH OpenFDO

Authors Jan Goedgebeur, Carol T. Zamfirescu

Publication date 21 May 2024

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclemaximum degreeexhaustive generationinfinite familyhypohamiltonian

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• K₂‐Hamiltonian graphs: II
• \(K_2\)-Hamiltonian graphs: I
• Planar Hypohamiltonian Graphs on 40 Vertices
• On almost hypohamiltonian graphs

Cites work

• scientific article; zbMATH DE number 1011075 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• scientific article; zbMATH DE number 3313414 (Why is no real title available?)
• K₂‐Hamiltonian graphs: II
• An Infinite Class of Hypohamiltonian Graphs
• Generation of cubic graphs
• House of graphs 2.0: a database of interesting graphs and more
• Improved bounds for hypo-Hamiltonian graphs
• Isomorph-Free Exhaustive Generation
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Planar cubic hypohamiltonian and hypotraceable graphs
• Practical graph isomorphism. II.
• Structural and computational results on platypus graphs
• \(K_2\)-Hamiltonian graphs: I

Cited in

(1)

• K₂‐Hamiltonian graphs: II

This page was built for publication: Generation and new infinite families of \(K_2\)-hypohamiltonian graphs

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