List Coloring with a Bounded Palette
- 18 December 2015
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 84 (1) , 93-103
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Universiteit Utrecht
- Agence Nationale de la Recherche (EGOS (2012-2015) 12 JS02 002 01)
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (639.031.138)
This publication has 9 references indexed in Scilit:
- Hypergraph containersInventiones Mathematicae, 2015
- Independent sets in hypergraphsJournal of the American Mathematical Society, 2014
- A note on random greedy coloring of uniform hypergraphsRandom Structures & Algorithms, 2014
- Improper Choosability and Property BJournal of Graph Theory, 2012
- List Colourings of Regular HypergraphsCombinatorics, Probability and Computing, 2012
- Coloring graphs from lists with bounded size of their unionJournal of Graph Theory, 2005
- Degrees and choice numbersRandom Structures & Algorithms, 2000
- On the choosability of complete multipartite graphs with part size threeDiscrete Mathematics, 2000
- Improved bounds and algorithms for hypergraph 2-coloringRandom Structures & Algorithms, 2000