Pages that link to "Item:Q1661495"
From MaRDI portal
The following pages link to Bounds on the dynamic chromatic number of a graph in terms of its chromatic number (Q1661495):
Displaying 5 items.
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
- (Q3001393) (← links)
- On <i>r</i>-dynamic chromatic number of some brick product graphs <i>C</i>(2<i>n</i>, 1, <i>p</i>) (Q5083048) (← links)