Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)

DOI10.1007/S10255-015-0531-ZzbMath1335.05069OpenAlexW2272208099WikidataQ123016457 ScholiaQ123016457MaRDI QIDQ277100

Li-hua Ma, Feng Wang, Guo-ping Zheng, Yu-fa Shen

Publication date: 4 May 2016

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-015-0531-z

zbMATH Keywords

list coloring\(f\)-choosablechromatic-choosable graphscomplete multipartite graphsOhba's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ohba's conjecture for graphs with independence number five
• List colouring when the chromatic number is close to the order of the graph
• 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
• 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
• On choosability of complete multipartite graphs K_{4,3*t,2*(k-2t-2),1*(t+1)}
• Graph colorings with local constraints -- a survey
• On chromatic‐choosable graphs

This page was built for publication: Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)