scientific article; zbMATH DE number 1123764
From MaRDI portal
Publication:4379734
DOI<87::AID-JGT4>3.0.CO;2-B 10.1002/(SICI)1097-0118(199802)27:2<87::AID-JGT4>3.0.CO;2-BzbMath0891.05031MaRDI QIDQ4379734
Sylvain Gravier, Frédéric Maffray
Publication date: 8 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ Choice numbers of multi-bridge graphs ⋮ Unnamed Item ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ On the choice number of claw-free perfect graphs ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ On the choosability of claw-free perfect graphs ⋮ Ohba's conjecture for graphs with independence number five ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) ⋮ 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 ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ⋮ A Proof of a Conjecture of Ohba
This page was built for publication:
