Ohba's conjecture is true for graphs with independence number at most three

DOI10.1016/J.AML.2009.01.001zbMATH Open1162.05319OpenAlexW2021033685WikidataQ123199697 ScholiaQ123199697MaRDI QIDQ1023085FDOQ1023085

Authors: Wenjie He, Yanpo Li, Yufa Shen, Guoping Zheng 

Publication date: 10 June 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.01.001

Recommendations

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

zbMATH Keywords

list coloringcomplete multipartite graphsindependence numberOhba's conjecturechromatic-choosable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Choice number of some complete multi-partite graphs
• On the choosability of complete multipartite graphs with part size three
• On choosability of some complete multipartite graphs and Ohba's conjecture
• List colourings of graphs
• Graph colorings with local constraints -- a survey
• Title not available (Why is that?)
• On chromatic‐choosable graphs
• Chromatic choosability of a class of complete multipartite graphs
• Title not available (Why is that?)
• List colouring when the chromatic number is close to the order of the graph
• Title not available (Why is that?)

Cited In (8)

• Application of polynomial method to on-line list colouring of graphs
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• Towards an on-line version of Ohba's conjecture
• Ohba's conjecture for graphs with independence number five
• Chromatic choosability of a class of complete multipartite graphs
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• A Proof of a Conjecture of Ohba
• On chromatic‐choosable graphs

This page was built for publication: Ohba's conjecture is true for graphs with independence number at most three

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