On choosability of complete multipartite graphs K₄,3*t,2*(k-2t-2),1*(t+1)

DOI10.7151/DMGT.1489MaRDI QIDQ3059092zbMATHOpenAlexFDO

Authors Guoping Zheng, Zuo-Li Chen, Jinfeng Lv, Yufa Shen

Publication date 8 December 2010

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1489

zbMATH Keywords

list coloringchromatic-choosable graphscomplete multipartite graphsOhba's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic choosability of a class of complete multipartite graphs
• 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 \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• On choosability of some complete multipartite graphs and Ohba's conjecture
• On-line list colouring of complete multipartite graphs

Cited in

(9)

• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
• Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
• On the choice number of complete multipartite graphs with part size four
• On-line list colouring of complete multipartite graphs
• Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.
• scientific article; zbMATH DE number 7296014 (Why is no real title available?)
• On choosability of some complete multipartite graphs and Ohba's conjecture
• Chromatic choosability of a class of complete multipartite graphs

This page was built for publication: On choosability of complete multipartite graphs \(K_{4,3*t,2*(k-2t-2),1*(t+1)}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059092)