Ohba's conjecture is true for graphs with independence number at most three

DOI10.1016/J.AML.2009.01.001zbMath1162.05319OpenAlexW2021033685WikidataQ123199697 ScholiaQ123199697MaRDI QIDQ1023085

Yanpo Li, Wenjie He, Guo-ping Zheng, Yu-fa Shen

Publication date: 10 June 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.01.001

zbMATH Keywords

independence numberlist coloringcomplete multipartite graphsOhba's conjecturechromatic-choosable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

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 ⋮ Towards an on-line version of Ohba's conjecture ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Ohba's conjecture for graphs with independence number five ⋮ A Proof of a Conjecture of Ohba

Cites Work

• List colouring when the chromatic number is close to the order of the graph
• Choice number of some complete multi-partite graphs
• On the choosability of complete multipartite graphs with part size three
• On choosability of some complete multipartite graphs and Ohba's conjecture
• Graph colorings with local constraints -- a survey
• On chromatic‐choosable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ohba's conjecture is true for graphs with independence number at most three