Publication:5463486
From MaRDI portal
zbMath1078.05032MaRDI QIDQ5463486
Publication date: 4 August 2005
05C15: Coloring of graphs and hypergraphs
Related Items
A Proof of a Conjecture of Ohba, Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\), Application of polynomial method to on-line list colouring of graphs, Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices, Ohba's conjecture for graphs with independence number five, On the choice number of complete multipartite graphs with part size four, 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, An algebraic criterion for the choosability of graphs, On choosability of some complete multipartite graphs and Ohba's conjecture