Pages that link to "Item:Q5176002"
From MaRDI portal
The following pages link to Colouring graphs when the number of colours is nearly the maximum degree (Q5176002):
Displayed 12 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)