Cycles with consecutive odd lengths

DOI10.1016/j.ejc.2015.09.002zbMath1327.05175arXiv1410.0430OpenAlexW1884418294MaRDI QIDQ896065

Jie Ma

Publication date: 11 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.0430

zbMATH Keywords

non-bipartite 2-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

Cycle lengths and minimum degree of graphs ⋮ Linear cycles of consecutive lengths ⋮ A Strengthening on Odd Cycles in Graphs of Given Chromatic Number ⋮ The extremal function for cycles of length \(\ell\) mod \(k\) ⋮ Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics ⋮ Cycles of given lengths in hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Girth in graphs
• Cycle lengths in sparse graphs
• Cycles of length 0 modulo 4 in graphs
• Distribution of cycle lengths in graphs
• The chromatic thresholds of graphs
• Dynamic cage survey
• On the chromatic number of pentagon-free graphs of large minimum degree
• On a valence problem in extremal graph theory
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Cycles of even lengths modulo k
• Another Simple Proof of the High Girth, High Chromatic Number Theorem
• Graph decomposition with applications to subdivisions and path systems modulo k
• Cycles Modulo k

This page was built for publication: Cycles with consecutive odd lengths