On the girth of forbidden subgraphs of coloring graphs

DOI10.1016/J.DISC.2024.113966zbMATH Open1539.05043MaRDI QIDQ6542005FDOQ6542005

Authors: Kara Walcher Shavo, Elias Svensson, Abigail Waldron 

Publication date: 21 May 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Forbidden subgraphs of coloring graphs
• Classifying coloring graphs
• Graph colourings with forbidden \(k\)-coloured subgraphs
• Coloring graphs characterized by a forbidden subgraph
• Coloring graphs characterized by a forbidden subgraph

zbMATH Keywords

coloring graphproper coloringsreconfiguration graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Classifying coloring graphs
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• Kuratowski's theorem
• Introduction to reconfiguration
• Sur le problème des courbes gauches en topologie.
• The Glauber Dynamics for Colourings of Bounded Degree Trees

This page was built for publication: On the girth of forbidden subgraphs of coloring graphs

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