The following pages link to (Q3839005):
Displaying 12 items.
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- Almost all k-colorable graphs are easy to color (Q3811723) (← links)
- On graphs having prescribed clique number, chromatic number, and maximum degree (Q4186359) (← links)
- Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1 (Q4894516) (← links)
- To an extremal problem on chromatic numbers of finite graphs (Q5327743) (← links)
