Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.

MaRDI QIDQ2804793zbMATHFDO

Authors Julian A. Allagan, P. D. jun. Johnson

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

complete multipartite graphchoice numberOhba number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
• 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)}\)
• Chromatic choosability of a class of complete multipartite graphs
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)

Cited in

(3)

• On the asymptotic value of the choice number of complete multi‐partite graphs
• scientific article; zbMATH DE number 2188340 (Why is no real title available?)
• On choosability of some complete multipartite graphs and Ohba's conjecture

This page was built for publication: Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.

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