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

DOI10.37236/12623MaRDI QIDQ6574399zbMATH OpenFDO

Authors Sean Kim, Michael E. Picollelli

Publication date 18 July 2024

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

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)

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

Cites work

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

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)