The following pages link to (Q2936711):
Displaying 8 items.
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- An analog of Brooks' theorem for dynamic colorings (Q509086) (← links)
- Dynamic chromatic number of regular graphs (Q713302) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- On \(r\)-dynamic chromatic number of graphs (Q908316) (← links)
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs (Q2012068) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs (Q5024667) (← links)
