Choice number of some complete multi-partite graphs

DOI10.1016/S0012-365X(01)00059-0zbMath0994.05066OpenAlexW1977814167MaRDI QIDQ1349076

Kyoji Ohba, Junko Sakamoto, Katsuhiro Ota, Hikoe Enomoto

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00059-0

zbMATH Keywords

chromatic numberslist coloringchoice numberscomplete multi-partite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ DP-colorings of graphs with high chromatic number ⋮ ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ ⋮ Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ On improperly chromatic-choosable graphs ⋮ Ohba's conjecture for graphs with independence number five ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) ⋮ Unnamed Item ⋮ Ohba's conjecture is true for graphs with independence number at most three ⋮ A Proof of a Conjecture of Ohba ⋮ An algebraic criterion for the choosability of graphs

This page was built for publication: Choice number of some complete multi-partite graphs