Ohba's conjecture for graphs with independence number five

DOI10.1016/J.DISC.2011.02.026MaRDI QIDQ536225zbMATH OpenOpenAlexWikidataFDO

Authors Michael Stiebitz, Alexandr Kostochka, Douglas R. Woodall

Publication date 16 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.02.026

zbMATH Keywords

choosabilitychromatic numbercomplete multipartite graphlist chromatic numberlist coloringvertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Ohba's conjecture is true for graphs with independence number at most three
• On choosability of some complete multipartite graphs and Ohba's conjecture
• Chromatic choosability of a class of complete multipartite graphs
• 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}\)

Cites work

• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
• Choice number of some complete multi-partite graphs
• Chromatic choosability of a class of complete multipartite graphs
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1123764 (Why is no real title available?)
• scientific article; zbMATH DE number 1789917 (Why is no real title available?)
• scientific article; zbMATH DE number 2192112 (Why is no real title available?)
• List colouring when the chromatic number is close to the order of the graph
• Ohba's conjecture is true for graphs with independence number at most three
• On choosability of some complete multipartite graphs and Ohba's conjecture
• On chromatic‐choosable graphs
• On Representatives of Subsets

Cited in

(7)

• Ohba's conjecture is true for graphs with independence number at most three
• Towards a version of Ohba's conjecture for improper colorings
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• scientific article; zbMATH DE number 1789917 (Why is no real title available?)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• A proof of a conjecture of Ohba
• Minimum non-chromatic--choosable graphs (extended abstract)

This page was built for publication: Ohba's conjecture for graphs with independence number five

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536225)