Towards a version of Ohba's conjecture for improper colorings
From MaRDI portal
Publication:2014228
Recommendations
- Improper colourings inspired by Hadwiger's conjecture
- About a Brooks-type theorem for improper colouring
- Improper C-colorings of graphs
- The complexity of some acyclic improper colourings
- Improved bound for improper colourings of graphs with no odd clique minor
- scientific article; zbMATH DE number 1146231
- A note on improper colorability of planar graphs
- Publication:4863459
- An improvement to Mathon's cyclotomic Ramsey colorings
- On a coloring conjecture of Hajós
Cites work
- scientific article; zbMATH DE number 1123764 (Why is no real title available?)
- scientific article; zbMATH DE number 1789917 (Why is no real title available?)
- A note on list-coloring powers of graphs
- A proof of a conjecture of Ohba
- A weaker version of a conjecture on list vertex arboricity of graphs
- Application of polynomial method to on-line list colouring of graphs
- Bipartite graphs whose squares are not chromatic-choosable
- Choice number of some complete multi-partite graphs
- Choosability of powers of circuits
- Chromatic-choosability of the power of graphs
- Counterexamples to the list square coloring conjecture
- List colouring when the chromatic number is close to the order of the graph
- List point arboricity of dense graphs
- Ohba's conjecture for graphs with independence number five
- On chromatic‐choosable graphs
- On improperly chromatic-choosable graphs
- On the choosability of complete multipartite graphs with part size three
- On-line list colouring of complete multipartite graphs
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Three topics in online list coloring
- Towards an on-line version of Ohba's conjecture
Cited in
(4)
This page was built for publication: Towards a version of Ohba's conjecture for improper colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014228)
