On choosability of some complete multipartite graphs and Ohba's conjecture

DOI10.1016/j.disc.2007.03.059zbMath1136.05021OpenAlexW2061431866WikidataQ122963900 ScholiaQ122963900MaRDI QIDQ2463475

Lingmin Zhang, Wenjie He, Yanning Wang, Yu-fa Shen, Guo-ping Zheng

Publication date: 12 December 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.059

zbMATH Keywords

list coloringOhba's conjectureChromatic-choosableComplete multipartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ Ohba's conjecture for graphs with independence number five ⋮ Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) ⋮ Ohba's conjecture is true for graphs with independence number at most three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colouring when the chromatic number is close to the order of the graph
• Choice number of some complete multi-partite graphs
• The list chromatic index of a bipartite multigraph
• On the choosability of complete multipartite graphs with part size three
• Some upper bounds on the total and list chromatic numbers of multigraphs
• On chromatic‐choosable graphs

This page was built for publication: On choosability of some complete multipartite graphs and Ohba's conjecture