A Proof of a Conjecture of Ohba
From MaRDI portal
Publication:5251204
DOI10.1002/jgt.21819zbMath1320.05045arXiv1211.1999OpenAlexW2103183688WikidataQ123220852 ScholiaQ123220852MaRDI QIDQ5251204
Jonathan A. Noel, Hehui Wu, Bruce A. Reed
Publication date: 22 May 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1999
Related Items (21)
The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Choice numbers of multi-bridge graphs ⋮ DP-colorings of graphs with high chromatic number ⋮ A generalization of Noel-Reed-Wu theorem to signed graphs ⋮ Partial list colouring of certain graphs ⋮ ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ Signed colouring and list colouring of k‐chromatic graphs ⋮ Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices ⋮ Towards an on-line version of Ohba's conjecture ⋮ Chromatic-choosability of the power of graphs ⋮ On-line choice number of complete multipartite graphs: an algorithmic approach ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ On improperly chromatic-choosable graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ List coloring a Cartesian product with a complete bipartite factor ⋮ DP color functions versus chromatic polynomials ⋮ Proportional choosability: a new list analogue of equitable coloring ⋮ An algebraic criterion for the choosability of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on list-coloring powers of graphs
- Application of polynomial method to on-line list colouring of graphs
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- 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
- Choice number of 3-colorable elementary graphs
- List edge and list total colourings of multigraphs
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- On the choosability of complete multipartite graphs with part size three
- Towards an on-line version of Ohba's conjecture
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Graph colorings with local constraints -- a survey
- On chromatic‐choosable graphs
- Counterexamples to the List Square Coloring Conjecture
- Distinct representatives of subsets
- Choosability conjectures and multicircuits
This page was built for publication: A Proof of a Conjecture of Ohba
