Towards a version of Ohba's conjecture for improper colorings
type: Item
instance of: scholarly article
title: Towards a version of Ohba's conjecture for improper colorings
zbMATH Open document ID: 1368.05057
author: Wei Wang
author: Zhidan Yan
author: Jianguo Qian
published in: Graphs and Combinatorics
publication date: 2017-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6759411
zbMATH Keywords: improper coloring
zbMATH Keywords: choice number
zbMATH Keywords: chromatic number
zbMATH Keywords: chromatic-choosability
MaRDI profile type: Publication
full work available at URL: s00373-017-1763-x
OpenAlex ID: W2569530628
Wikidata QID: Q123005020
cites work: Three topics in online list coloring
cites work: Choice number of some complete multi-partite graphs
cites work: Ohba's conjecture for graphs with independence number five
cites work: Q4379734
cites work: Application of polynomial method to on-line list colouring of graphs
cites work: On the choosability of complete multipartite graphs with part size three
cites work: On-line list colouring of complete multipartite graphs
cites work: Chromatic-choosability of the power of graphs
cites work: Towards an on-line version of Ohba's conjecture
cites work: Counterexamples to the List Square Coloring Conjecture
cites work: Bipartite graphs whose squares are not chromatic-choosable
cites work: A note on list-coloring powers of graphs
cites work: A Proof of a Conjecture of Ohba
cites work: On chromatic‐choosable graphs
cites work: Choosability of powers of circuits
cites work: Q4549228
cites work: List colouring when the chromatic number is close to the order of the graph
cites work: Proof of the list edge coloring conjecture for complete graphs of prime degree
cites work: A weaker version of a conjecture on list vertex arboricity of graphs
cites work: On improperly chromatic-choosable graphs
cites work: List point arboricity of dense graphs
DOI: 10.1007/S00373-017-1763-X
Recommended article: Improper colourings inspired by Hadwiger's conjecture
Recommended article: Q3614028
Recommended article: Improper C-colorings of graphs
Recommended article: The complexity of some acyclic improper colourings
Recommended article: Improved bound for improper colourings of graphs with no odd clique minor
Recommended article: Q4386303
Recommended article: Q4641211
Recommended article: Q4863459
Recommended article: An improvement to Mathon's cyclotomic Ramsey colorings
Recommended article: On a coloring conjecture of Hajós
description: scientific article; zbMATH DE number 6759411