Pages that link to "Item:Q713309"
From MaRDI portal
The following pages link to Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309):
Displaying 14 items.
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← 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)
- On dynamic coloring of certain cycle-related graphs (Q2302720) (← links)
- \(r\)-Dynamic chromatic number of some line graphs (Q2322985) (← links)
- δ-Dynamic chromatic number of Helm graph families (Q4966761) (← links)
- (Q4984893) (← links)
- On r− dynamic coloring of the gear graph families (Q5027695) (← links)
- On r-dynamic vertex coloring of some flower graph families (Q5063273) (← links)
- (Q5071875) (← links)
- (Q5376964) (← links)
- On r- dynamic coloring of the family of bistar graphs (Q5865868) (← links)
- Weak dynamic coloring of planar graphs (Q6121912) (← links)
