Ohba's conjecture is true for graphs with independence number at most three
type: Item
instance of: scholarly article
title: Ohba's conjecture is true for graphs with independence number at most three
zbMATH Open document ID: 1162.05319
author: Wenjie He
author: Yanpo Li
author: Yufa Shen
author: Guoping Zheng
published in: Applied Mathematics Letters
publication date: 2009-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5563924
zbMATH Keywords: list coloring
zbMATH Keywords: chromatic-choosable
zbMATH Keywords: Ohba's conjecture
zbMATH Keywords: independence number
zbMATH Keywords: complete multipartite graphs
MaRDI profile type: Publication
full work available at URL: j.aml.2009.01.001
OpenAlex ID: W2021033685
Wikidata QID: Q123199697
cites work: Q3115277
cites work: Q3922703
cites work: List colourings of graphs
cites work: On chromatic‐choosable graphs
cites work: List colouring when the chromatic number is close to the order of the graph
cites work: Choice number of some complete multi-partite graphs
cites work: Q4379734
cites work: Q5463486
cites work: On choosability of some complete multipartite graphs and Ohba's conjecture
cites work: Q5452942
cites work: On the choosability of complete multipartite graphs with part size three
cites work: Graph colorings with local constraints -- a survey
DOI: 10.1016/J.AML.2009.01.001
description: scientific article; zbMATH DE number 5563924