Classifying coloring graphs
From MaRDI portal
Publication:284746
DOI10.1016/j.disc.2016.03.003zbMath1336.05040OpenAlexW2342698525MaRDI QIDQ284746
Kara Shavo, Janet Fierson, Ruth Haas, Heather M. Russell, Julie Beier
Publication date: 18 May 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.03.003
Related Items (13)
Reconfiguration graphs of shortest paths ⋮ Unnamed Item ⋮ Forbidden subgraphs of coloring graphs ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ Reconfiguration graphs of zero forcing sets ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ Unnamed Item ⋮ Cut-colorings in coloring graphs ⋮ On k-Total Dominating Graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ Reconfiguration graphs for dominating sets ⋮ Irredundance graphs ⋮ Introduction to reconfiguration
Cites Work
- Unnamed Item
- Unnamed Item
- Reconfiguration of dominating sets
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
- Mixing 3-colourings in bipartite graphs
- Z-transformation graphs of perfect matchings of hexagonal systems
- The \(k\)-dominating graph
- Connectedness of the graph of vertex-colourings
- Improved bounds for sampling colorings
- The complexity of change
- The canonical coloring graph of trees and cycles
- A Reconfigurations Analogue of Brooks’ Theorem
- Finding paths between 3-colorings
- γ-graphs of graphs
- Gray code numbers for graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
- 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: Classifying coloring graphs
