Towards a version of Ohba's conjecture for improper colorings
From MaRDI portal
Publication:2014228
DOI10.1007/s00373-017-1763-xzbMath1368.05057OpenAlexW2569530628WikidataQ123005020 ScholiaQ123005020MaRDI QIDQ2014228
Wei Wang, Zhidan Yan, Jian Guo Qian
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1763-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on list-coloring powers of graphs
- Application of polynomial method to on-line list colouring of graphs
- On-line list colouring of complete multipartite graphs
- Chromatic-choosability of the power of graphs
- A weaker version of a conjecture on list vertex arboricity of graphs
- On improperly chromatic-choosable graphs
- Ohba's conjecture for graphs with independence number five
- List colouring when the chromatic number is close to the order of the graph
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- List point arboricity of dense graphs
- Choice number of some complete multi-partite graphs
- Choosability of powers of circuits
- On the choosability of complete multipartite graphs with part size three
- Bipartite graphs whose squares are not chromatic-choosable
- Towards an on-line version of Ohba's conjecture
- Three topics in online list coloring
- On chromatic‐choosable graphs
- Counterexamples to the List Square Coloring Conjecture
- A Proof of a Conjecture of Ohba
This page was built for publication: Towards a version of Ohba's conjecture for improper colorings
