Forbidden subgraphs of coloring graphs
From MaRDI portal
Recommendations
Cites work
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Classifying coloring graphs
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Improved bounds for sampling colorings
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- The canonical coloring graphs of trees and cycles
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- Z-transformation graphs of perfect matchings of hexagonal systems
Cited in
(10)- Interval vertex-coloring of a graph with forbidden colors
- 3-colourability and forbidden subgraphs
- Classifying coloring graphs
- Graph colourings with forbidden \(k\)-coloured subgraphs
- scientific article; zbMATH DE number 4160759 (Why is no real title available?)
- scientific article; zbMATH DE number 5763169 (Why is no real title available?)
- The coloring graph of complete graphs
- On the girth of forbidden subgraphs of coloring graphs
- Counting subgraphs of coloring graphs
- Coloring graphs as complete graph invariants
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)