Forbidden subgraphs of coloring graphs

DOI10.2140/INVOLVE.2018.11.311MaRDI QIDQ1684531zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Classifying coloring graphs
• Graph colourings with forbidden \(k\)-coloured subgraphs
• Coloring graphs characterized by a forbidden subgraph
• Coloring graphs characterized by a forbidden subgraph
• A survey on the computational complexity of coloring graphs with forbidden subgraphs

Cites work

• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Classifying coloring graphs
• Improved bounds for sampling colorings
• 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
• The canonical coloring graphs of trees and cycles
• Z-transformation graphs of perfect matchings of hexagonal systems

Cited in

(8)

• Graph colourings with forbidden \(k\)-coloured subgraphs
• Interval vertex-coloring of a graph with forbidden colors
• Classifying coloring graphs
• scientific article; zbMATH DE number 4160759 (Why is no real title available?)
• On the girth of forbidden subgraphs of coloring graphs
• 3-colourability and forbidden subgraphs
• scientific article; zbMATH DE number 5763169 (Why is no real title available?)
• The coloring graph of complete graphs

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

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