Cycles in color-critical graphs

DOI10.37236/10177zbMath1486.05099arXiv1912.03754OpenAlexW4206450801MaRDI QIDQ2121717

Benjamin Moore, Douglas B. West

Publication date: 4 April 2022

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

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

zbMATH Keywords

Minty's theoremgeneralized Kempe chain technique

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

Congruence of cycle lengths and chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• A dichotomy theorem for circular colouring reconfiguration
• Coloring digraphs with forbidden cycles
• Graph coloring in linear time
• Double-critical graphs and complete minors
• Cycles of length 2 modulo 3 in graphs
• The dichromatic number of a digraph
• Circular colouring and orientation of graphs
• Circumference, chromatic number and online coloring
• A Theorem on n-Coloring the Points of a Linear Graph
• A Strengthening on Odd Cycles in Graphs of Given Chromatic Number
• On chromatic number of graphs and set-systems
• Circular chromatic number: A survey

This page was built for publication: Cycles in color-critical graphs