Ohba's conjecture for graphs with independence number five
type: Item
instance of: scholarly article
title: Ohba's conjecture for graphs with independence number five
zbMATH Open document ID: 1223.05077
author: Michael Stiebitz
author: Alexandr Kostochka
author: Douglas R. Woodall
published in: Discrete Mathematics
publication date: 2011-05-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5888524
zbMATH Keywords: chromatic number
zbMATH Keywords: vertex coloring
zbMATH Keywords: list coloring
zbMATH Keywords: list chromatic number
zbMATH Keywords: choosability
zbMATH Keywords: complete multipartite graph
MaRDI profile type: Publication
full work available at URL: j.disc.2011.02.026
OpenAlex ID: W2120044050
Wikidata QID: Q123009835
cites work: Choice number of some complete multi-partite graphs
cites work: Q3922703
cites work: Q4379734
cites work: On Representatives of Subsets
cites work: Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
cites work: On chromatic‐choosable graphs
cites work: Q5463486
cites work: Q4549228
cites work: List colouring when the chromatic number is close to the order of the graph
cites work: Ohba's conjecture is true for graphs with independence number at most three
cites work: On choosability of some complete multipartite graphs and Ohba's conjecture
cites work: Q5452942
DOI: 10.1016/J.DISC.2011.02.026
description: scientific article; zbMATH DE number 5888524