On the choice number of complete multipartite graphs with part size four
From MaRDI portal
Publication:739044
DOI10.1016/j.ejc.2016.05.001zbMath1343.05062arXiv1407.3817OpenAlexW1600740451MaRDI QIDQ739044
Andrew Salmon, Ran Wang, Henry A. Kierstead
Publication date: 16 August 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.3817
Cites Work
- Unnamed Item
- 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
- List colouring when the chromatic number is close to the order of the graph
- List colourings of planar graphs
- Chip games and paintability
- Every planar graph is 5-choosable
- The list chromatic index of a bipartite multigraph
- On the choosability of complete multipartite graphs with part size three
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Towards an on-line version of Ohba's conjecture
- Choice Numbers of Graphs: a Probabilistic Approach
- On the asymptotic value of the choice number of complete multi‐partite graphs
This page was built for publication: On the choice number of complete multipartite graphs with part size four