Edge maximal non-bipartite graphs without odd cycles of prescribed lengths

DOI10.1007/s003730200004zbMath0997.05050OpenAlexW1983443477MaRDI QIDQ1348667

Rui-Zhong Jia, Louis Caccetta

Publication date: 14 May 2002

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

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

zbMATH Keywords

extremal graphsodd cycleHamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (2)

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

This page was built for publication: Edge maximal non-bipartite graphs without odd cycles of prescribed lengths