Pages that link to "Item:Q6073792"
From MaRDI portal
The following pages link to Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792):
Displaying 4 items.
- Inequalities between the domination number and the chromatic number of a graph (Q1121277) (← links)
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)