On a conjecture of Grünbaum on longest cycles

DOI10.1016/j.ejc.2023.103791OpenAlexW4386010535WikidataQ123110230 ScholiaQ123110230MaRDI QIDQ6080370

Carol T. Zamfirescu

Publication date: 2 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2023.103791

zbMATH Keywords

Hamiltonian graphcircumferenceGrünbaum conjecture\(c\)-connected graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
• Locally Hamiltonian graphs
• Hypohamiltonian and hypotraceable graphs
• Vertices missed by longest paths or circuits
• Every graph occurs as an induced subgraph of some hypohamiltonian graph
• $K_2$-Hamiltonian Graphs: I
• On Hypohamiltonian and Almost Hypohamiltonian Graphs
• Flip-Flops in Hypohamiltonian Graphs

This page was built for publication: On a conjecture of Grünbaum on longest cycles