Classifying coloring graphs

DOI10.1016/J.DISC.2016.03.003zbMATH Open1336.05040OpenAlexW2342698525MaRDI QIDQ284746FDOQ284746

Authors: Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Shavo 

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

Recommendations

• Forbidden subgraphs of coloring graphs
• Open problems on graph coloring for special graph classes
• A survey on the computational complexity of coloring graphs with forbidden subgraphs
• The canonical coloring graphs of trees and cycles
• Graph colourings with forbidden \(k\)-coloured subgraphs

zbMATH Keywords

coloring graphproper coloringsreconfiguration graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• 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 graphs of trees and cycles
• A reconfigurations analogue of Brooks' theorem
• Finding paths between 3-colorings
• \(\gamma\)-graphs of graphs
• Gray code numbers for graphs
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• Title not available (Why is that?)
• Mixing homomorphisms, recolorings, and extending circular precolorings
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

Cited In (20)

• The coloring graph of complete graphs
• Cut-colorings in coloring graphs
• Construction of sparse graphs with prescribed circular colorings
• Block symmetries in graph coloring reconfiguration systems
• Irredundance graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Introduction to reconfiguration
• On k-Total Dominating Graphs
• On list equitable total colorings of the generalized theta graph
• Reconfiguration graphs of shortest paths
• Reconfiguration graphs for dominating sets
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• On reconfiguration graphs: an abstraction
• Graph coloring satisfying restraints
• Forbidden subgraphs of coloring graphs
• The canonical coloring graphs of trees and cycles
• A note on graphs of \(k\)-colourings
• Neochromatica.
• On the girth of forbidden subgraphs of coloring graphs
• Reconfiguration graphs of zero forcing sets

This page was built for publication: Classifying coloring graphs

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