List colouring when the chromatic number is close to the order of the graph
From MaRDI portal
(Redirected from Publication:558319)
Recommendations
- List-colourings of graphs
- scientific article; zbMATH DE number 5531976
- List colourings of graphs
- scientific article; zbMATH DE number 7637228
- List-distinguishing colorings of graphs
- scientific article; zbMATH DE number 1789917
- Partial list colouring of certain graphs
- Near-optimal list colorings
- The list chromatic numbers of some planar graphs
- List colourings of planar graphs
Cited in
(19)- Application of polynomial method to on-line list colouring of graphs
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- scientific article; zbMATH DE number 1789917 (Why is no real title available?)
- Towards an on-line version of Ohba's conjecture
- Ohba's conjecture for graphs with independence number five
- Towards a version of Ohba's conjecture for improper colorings
- An algebraic criterion for the choosability of graphs
- Ohba's conjecture is true for graphs with independence number at most three
- Chromatic-choosability of hypergraphs with high chromatic number
- Randomly colouring graphs (a combinatorial view)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- Coloring Graphs with Dense Neighborhoods
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- On choosability of some complete multipartite graphs and Ohba's conjecture
- On the choice number of complete multipartite graphs with part size four
- Graphs with \(\chi=\Delta\) have big cliques
- A weaker version of a conjecture on list vertex arboricity of graphs
- List point arboricity of dense graphs
- A proof of a conjecture of Ohba
This page was built for publication: List colouring when the chromatic number is close to the order of the graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558319)
