scientific article
From MaRDI portal
Publication:2741180
zbMath0979.05047MaRDI QIDQ2741180
Publication date: 17 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ List-colouring the square of a \(K_4\)-minor-free graph ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ The average degree of a multigraph critical with respect to edge or total choosability ⋮ On group choosability of graphs. II ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ Contractibility and the Hadwiger conjecture ⋮ List coloring of Cartesian products of graphs ⋮ Sum list coloring graphs ⋮ List-edge and list-total colorings of graphs embedded on hyperbolic surfaces ⋮ Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) ⋮ A note on list improper coloring of plane graphs ⋮ Coloring graphs from lists with bounded size of their union ⋮ Defective choosability of graphs with no edge-plus-independent-set minor ⋮ Ohba's conjecture is true for graphs with independence number at most three ⋮ Entire choosability of near-outerplane graphs ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ A Proof of a Conjecture of Ohba
This page was built for publication:
