The following pages link to A new kind of graph coloring (Q5468865):
Displaying 11 items.
- A strict strong coloring of trees (Q989572) (← links)
- On some domination colorings of graphs (Q2399288) (← links)
- A new coloring theorem of Kneser graphs (Q2431265) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- (Q4533083) (← links)
- (Q4636174) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- On strict strong coloring of graphs (Q5013494) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- A new color change to improve the coloring of a graph (Q5893808) (← links)
- Frozen development in graph coloring (Q5958809) (← links)