4-Chromatic graphs have at least four cycles of length 0 mod 3

DOI10.37236/12623zbMATH Open1543.05054MaRDI QIDQ6574399FDOQ6574399

Authors: Sean Kim, Michael E. Picollelli 

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Cycles of length 0 modulo 4 in graphs
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Cycle lengths and minimum degree of graphs
• Publication:4489193
• scientific article; zbMATH DE number 2188330

zbMATH Keywords

dichotomyreconfigurationcircular colouringrecolouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Coloring digraphs with forbidden cycles
• Cycles of length 0 modulo 4 in graphs
• Graphs with a cycle of length divisible by three
• A dichotomy theorem for circular colouring reconfiguration
• Graph decomposition with applications to subdivisions and path systems modulo k
• Graph coloring in linear time
• Cycles in color-critical graphs
• Cycles of even lengths modulo \(k\)
• Cycles Modulo k
• The extremal function for cycles of length \(\ell\) mod \(k\)
• A strengthening on odd cycles in graphs of given chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified proof of conjectures on cycle lengths in graphs
• Cycles of length 2 modulo 3 in graphs
• Cycles of length 1 modulo 3 in graph
• Title not available (Why is that?)

This page was built for publication: 4-Chromatic graphs have at least four cycles of length 0 mod 3

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