Ohba's conjecture is true for graphs K_t+2,3,2(k-t-2),1 t

DOI10.1007/S10255-015-0531-ZMaRDI QIDQ277100zbMATH OpenOpenAlexWikidataFDO

Authors Yufa Shen, Guoping Zheng, Li-hua Ma, Feng Wang

Publication date 4 May 2016

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-015-0531-z

zbMATH Keywords

list coloring\(f\)-choosablechromatic-choosable graphscomplete multipartite graphsOhba's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Ohba's conjecture is true for graphs with independence number at most three
• Hadwiger's conjecture is true for almost every graph
• The 1-2-3 conjecture almost holds for regular graphs
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• The 1‐2‐3‐conjecture holds for dense graphs
• The \(\Delta^2\) conjecture holds for graphs of small order
• Ohba's conjecture for graphs with independence number five
• The 1-2-3-conjecture for hypergraphs
• Enomoto and Ota's conjecture holds for large graphs
• The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (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?)
• 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
• Graph colorings with local constraints -- a survey
• List colouring when the chromatic number is close to the order of the graph
• List colourings of graphs
• Ohba's conjecture for graphs with independence number five
• Ohba's conjecture is true for graphs with independence number at most three
• On choosability of complete multipartite graphs \(K_{4,3*t,2*(k-2t-2),1*(t+1)}\)
• On choosability of some complete multipartite graphs and Ohba's conjecture
• On chromatic‐choosable graphs
• On the choosability of complete multipartite graphs with part size three

Cited in

(6)

• On choosability of complete multipartite graphs \(K_{4,3*t,2*(k-2t-2),1*(t+1)}\)
• Ohba's conjecture for graphs with independence number five
• Ohba's conjecture is true for graphs with independence number at most three
• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
• Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.
• Chromatic choosability of a class of complete multipartite graphs

This page was built for publication: Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)

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