Cycle lengths and minimum degree of graphs

DOI10.1016/j.jctb.2017.08.002zbMath1375.05152arXiv1508.07912OpenAlexW2963120913MaRDI QIDQ1682209

Jie Ma, Chun-Hung Liu

Publication date: 28 November 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreeThomassen's conjecturecycle length modulo \(k\)cycles of consecutive lengths

Mathematics Subject Classification ID

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

Related Items (13)

Linear cycles of consecutive lengths ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ Congruence of cycle lengths and chromatic number ⋮ Coloring Graphs with Two Odd Cycle 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 ⋮ On a conjecture of Bondy and Vince ⋮ Cycles of given lengths in hypergraphs ⋮ Cycle lengths in expanding graphs ⋮ Cycle lengths modulo \(k\) in expanders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring digraphs with forbidden cycles
• The extremal function for cycles of length \(\ell\) mod \(k\)
• Cycles with consecutive odd lengths
• Cycle lengths in sparse graphs
• Special subdivisions of \(K_4\) and 4-chromatic graphs
• Non-separating induced cycles in graphs
• Graphs with \(k\) odd cycle lengths
• Cycles of length 0 modulo 4 in graphs
• Graphs with a cycle of length divisible by three
• Cycles in triangle-free graphs of large chromatic number
• Cycles of even length in graphs
• Distribution of cycle lengths in graphs
• A note on cycle lengths in graphs
• Cycle lengths and chromatic number of graphs
• Circumference, chromatic number and online coloring
• Pancyclic graphs. I
• On Arithmetic Progressions of Cycle Lengths in Graphs
• Cycles of even lengths modulo k
• Cycles and paths in graphs with large minimal degree
• Graph decomposition with applications to subdivisions and path systems modulo k
• The longest cycle of a graph with a large minimal degree
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Cycles Modulo k
• Weakly pancyclic graphs
• SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
• Cycle lengths in graphs with large minimum degree
• On chromatic number of graphs and set-systems
• Some Theorems on Abstract Graphs

This page was built for publication: Cycle lengths and minimum degree of graphs