Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
From MaRDI portal
Publication:458608
DOI10.1016/j.ejc.2014.08.032zbMath1301.05132arXiv1308.6739OpenAlexW2962798202WikidataQ123308432 ScholiaQ123308432MaRDI QIDQ458608
Xuding Zhu, Hehui Wu, Douglas B. West, Jonathan A. Noel
Publication date: 8 October 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6739
Related Items (3)
Chromatic-choosability of hypergraphs with high chromatic number ⋮ On the choice number of complete multipartite graphs with part size four ⋮ A Proof of a Conjecture of Ohba
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ohba's conjecture for graphs with independence number five
- 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
- Choice number of some complete multi-partite graphs
- On the choosability of complete multipartite graphs with part size three
- Graphs with $\chi=\Delta$ Have Big Cliques
- Graph colorings with local constraints -- a survey
- Choice Numbers of Graphs: a Probabilistic Approach
- On chromatic‐choosable graphs
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- On the asymptotic value of the choice number of complete multi‐partite graphs
- Coloring Graphs with Dense Neighborhoods
- Distinct representatives of subsets
This page was built for publication: Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
