On the choosability of complete multipartite graphs with part size three
From MaRDI portal
Publication:1969804
DOI10.1016/S0012-365X(99)00157-0zbMath0944.05031OpenAlexW2014373569MaRDI QIDQ1969804
Publication date: 15 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00157-0
Related Items (21)
The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ Graphs with $\chi=\Delta$ Have Big Cliques ⋮ Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices ⋮ The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree ⋮ List Coloring with a Bounded Palette ⋮ 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 ⋮ Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker ⋮ Chromatic-choosability of the power of graphs ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ On a generalization of Rubin's theorem ⋮ Bipartite graphs whose squares are not chromatic-choosable ⋮ 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}\) ⋮ On the choice number of complete multipartite graphs with part size four ⋮ Ohba's conjecture is true for graphs with independence number at most three ⋮ Coloring Graphs with Dense Neighborhoods ⋮ A Proof of a Conjecture of Ohba ⋮ An algebraic criterion for the choosability of graphs
This page was built for publication: On the choosability of complete multipartite graphs with part size three
