The following pages link to Classifying coloring graphs (Q284746):
Displaying 19 items.
- Graph coloring satisfying restraints (Q910410) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- Forbidden subgraphs of coloring graphs (Q1684531) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Irredundance graphs (Q2081464) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- The canonical coloring graphs of trees and cycles (Q2892015) (← links)
- Neochromatica. (Q3083878) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- (Q5026983) (← links)
- (Q5241089) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- Construction of sparse graphs with prescribed circular colorings (Q5936037) (← links)
- Block symmetries in graph coloring reconfiguration systems (Q6107838) (← links)
- On the girth of forbidden subgraphs of coloring graphs (Q6542005) (← links)