The following pages link to Adynamic coloring of graphs (Q777385):
Displaying 5 items.
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- (Q4607872) (← links)
- Dynamic coloring on restricted graph classes (Q6057319) (← links)