scientific article; zbMATH DE number 1189240
From MaRDI portal
Publication:3839005
Recommendations
- Colouring graphs when the number of colours is almost the maximum degree
- The complexity of changing colourings with bounded maximum degree
- Graphs with small chromatic numbers are easy to color
- Colouring graphs when the number of colours is nearly the maximum degree
- The complexity of colouring problems on dense graphs
Cited in
(18)- Colouring graphs when the number of colours is nearly the maximum degree
- Randomly colouring graphs (a combinatorial view)
- Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
- Graphs with chromatic numbers strictly less than their colouring numbers
- Asymptotically optimal frugal colouring
- Colouring Non-sparse Random Intersection Graphs
- The complexity of colouring problems on dense graphs
- Partitioning a graph into degenerate subgraphs
- Almost all k-colorable graphs are easy to color
- Extremal values of the chromatic number for a given degree sequence
- (\(\Delta-k\))-critical graphs
- On graphs having prescribed clique number, chromatic number, and maximum degree
- Graphs with chromatic number close to maximum degree
- To an extremal problem on chromatic numbers of finite graphs
- A strengthening of Brooks' theorem
- Graphs with small chromatic numbers are easy to color
- Colouring graphs when the number of colours is almost the maximum degree
- Algorithmic bounds for the chromatic number†
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839005)
