On improperly chromatic-choosable graphs
From MaRDI portal
Publication:497383
DOI10.1007/s00373-014-1438-9zbMath1327.05129OpenAlexW2043166427MaRDI QIDQ497383
Nini Xue, Zhidan Yan, Wei Wang
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1438-9
Related Items
Chromatic-choosability of hypergraphs with high chromatic number, Towards a version of Ohba's conjecture for improper colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of polynomial method to on-line list colouring of graphs
- List point arboricity of dense graphs
- Choice number of some complete multi-partite graphs
- Towards an on-line version of Ohba's conjecture
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- On chromatic‐choosable graphs
- A Proof of a Conjecture of Ohba
- Improper Choosability and Property B