Forbidden subgraphs of coloring graphs

DOI10.2140/INVOLVE.2018.11.311zbMath1387.05079OpenAlexW2765516627MaRDI QIDQ1684531

Francisco Alvarado, Heather M. Russell, Ashley Butts, Lauren Farquhar

Publication date: 11 December 2017

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2018.11.311

zbMATH Keywords

coloring graphforbidden subgraphproper graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Classifying coloring graphs
• Z-transformation graphs of perfect matchings of hexagonal systems
• Improved bounds for sampling colorings
• The canonical coloring graph of trees and cycles
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

This page was built for publication: Forbidden subgraphs of coloring graphs