Chromatic-choosability of hypergraphs with high chromatic number
From MaRDI portal
Publication:668048
zbMath1411.05096arXiv1807.08273MaRDI QIDQ668048
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.08273
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
- Hypergraph containers
- On improperly chromatic-choosable graphs
- List colouring when the chromatic number is close to the order of the graph
- Choice number of some complete multi-partite graphs
- Choice number of 3-colorable elementary graphs
- Asymptotically good list-colorings
- List coloring hypergraphs
- On the choosability of complete multipartite graphs with part size three
- Towards a version of Ohba's conjecture for improper colorings
- Hypergraph extension of the Alon-Tarsi list coloring theorem
- List Colourings of Regular Hypergraphs
- Hypergraph list coloring and Euclidean Ramsey theory
- Betti Numbers of Hypergraphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Graph colorings with local constraints -- a survey
- On chromatic‐choosable graphs
- Hajós' theorem for list colorings of hypergraphs
- A Proof of a Conjecture of Ohba
- Coloring Claw-Free Graphs with $\Delta-1$ Colors
- Coloring Graphs with Dense Neighborhoods
This page was built for publication: Chromatic-choosability of hypergraphs with high chromatic number
