Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A note on cycle lengths in graphs

From MaRDI portal
Publication:1865137
Jump to:navigation, search

DOI10.1007/s003730200035zbMath1009.05079OpenAlexW1985239078MaRDI QIDQ1865137

Penny E. Haxell, Ronald J. Gould, Alexander D. Scott

Publication date: 25 March 2003

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

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


zbMATH Keywords

circumferenceminimum degreecycle lengths


Mathematics Subject Classification ID

Paths and cycles (05C38)


Related Items (11)

A new class of Ramsey-Turán problems ⋮ Cycle lengths and minimum degree of graphs ⋮ Cycles of many lengths in Hamiltonian graphs ⋮ Eigenvalues and cycles of consecutive lengths ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs ⋮ The Ramsey number of a long even cycle versus a star ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Cycle spectra of Hamiltonian graphs ⋮ Cycle lengths in sparse graphs ⋮ Pancyclicity of Hamiltonian and highly connected graphs ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)




This page was built for publication: A note on cycle lengths in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1865137&oldid=14250888"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki