Unavoidable cycle lengths in graphs

DOI10.1002/JGT.20072MaRDI QIDQ3022736zbMATH OpenOpenAlexDBLPWikidataFDO

Authors J. Verstraëte

Publication date 30 June 2005

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20072

zbMATH Keywords

\(k\)-connectedbinomial distributionlongest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• On the number of sets of cycle lengths
• The extremal function for cycles of length \(\ell\) mod \(k\)
• Cycles with consecutive odd lengths
• Cycle lengths in sparse graphs
• A note on cycle lengths in graphs

Cited in

(13)

• Long cycles in Hamiltonian graphs
• On the Erdős-Gyárfás conjecture in claw-free graphs
• Triangles in graphs without bipartite suspensions
• On the minimal length of the longest trail in a fixed edge-density graph
• Note on graphs without repeated cycle lengths
• Classes of cubic graphs containing cycles of integer-power lengths
• On 2-power unicyclic cubic graphs
• The extremal function for cycles of length \(\ell\) mod \(k\)
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• A solution to Erdős and Hajnal’s odd cycle problem
• A general theorem in spectral extremal graph theory
• On the number of sets of cycle lengths
• Expression of a tensor commutation matrix in terms of the generalized Gell-Mann matrices

This page was built for publication: Unavoidable cycle lengths in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022736)