Pages that link to "Item:Q442373"

The following pages link to On the difference between chromatic number and dynamic chromatic number of graphs (Q442373):

Displaying 21 items.

• 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)
• Bounds on the dynamic chromatic number of a graph in terms of its chromatic number (Q1661495) (← links)
• A counterexample to montgomery's conjecture on dynamic colourings of regular graphs (Q2012068) (← links)
• \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs (Q2097109) (← 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)
• On \(r\)-dynamic coloring of grids (Q2345621) (← links)
• On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
• Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
• δ-Dynamic chromatic number of Helm graph families (Q4966761) (← links)
• (Q4984893) (← links)
• On r− dynamic coloring of the gear graph families (Q5027695) (← links)
• (Q5071885) (← links)
• (Q5376964) (← links)
• On r- dynamic coloring of the family of bistar graphs (Q5865868) (← links)
• On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph (Q5866019) (← links)
• The $r$-dynamic edge coloring of a closed helm graph (Q6145412) (← links)
• Optimal secret share distribution in degree splitting communication networks (Q6186165) (← links)