Maximal cycles in graphs

DOI10.1016/0012-365X(91)90407-SzbMath0755.05064MaRDI QIDQ1185084

S. Singh

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphscircumferencesimple graphmaximal cyclesWoodall's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (8)

On some three-color Ramsey numbers for paths ⋮ A note on Turán numbers for even wheels ⋮ Unnamed Item ⋮ Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order ⋮ The codiameter of a 2-connected graph ⋮ Graphs with almost all edges in long cycles ⋮ Cycles in 2-connected graphs ⋮ On some three color Ramsey numbers for paths and cycles

Cites Work

• Unnamed Item
• Long cycles in subgraphs with prescribed minimum degree
• Graphs with unavoidable subgraphs with large degrees
• Maximal circuits of graphs. I

This page was built for publication: Maximal cycles in graphs