Generation and new infinite families of K₂-hypohamiltonian graphs

DOI10.1016/J.DISC.2024.113981zbMATH Open1539.05151MaRDI QIDQ6542014FDOQ6542014

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)

Cites Work

• House of graphs 2.0: a database of interesting graphs and more
• Practical graph isomorphism. II.
• Improved bounds for hypohamiltonian graphs
• Generation of cubic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Isomorph-Free Exhaustive Generation
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Planar cubic hypohamiltonian and hypotraceable graphs
• Title not available (Why is that?)
• An Infinite Class of Hypohamiltonian Graphs
• Title not available (Why is that?)
• Structural and computational results on platypus graphs
• $K_2$-Hamiltonian Graphs: I
• 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)