An extremal problem for cycles in hamiltonian graphs

DOI10.1007/BF01793012zbMath0837.05070OpenAlexW1993300648MaRDI QIDQ1900521

George R. T. Hendry, Stephan Brandt

Publication date: 29 November 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01793012

zbMATH Keywords

cyclehamiltonian graphextremal graph

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order ⋮ Weakly pancyclic graphs

Cites Work

• Unnamed Item
• Graphs without quadrilaterals
• Cycles of even length in graphs
• Pancyclic graphs. I
• Large cycles in graphs
• Graphs without four-cycles
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On critically hamiltonian graphs
• Weakly pancyclic graphs
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: An extremal problem for cycles in hamiltonian graphs