Linear choosability of graphs
Authors:
- 1 September 2008
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (17) , 3938-3950
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A bound on the chromatic number of the square of a planar graphJournal of Combinatorial Theory, Series B, 2005
- Coloring the square of a planar graphJournal of Graph Theory, 2002
- Acyclic list 7‐coloring of planar graphsJournal of Graph Theory, 2002
- List Improper Colourings of Planar GraphsCombinatorics, Probability and Computing, 1999
- Colouring a graph frugallyCombinatorica, 1997
- Graph colorings with local constraints -- a surveyDiscussiones Mathematicae Graph Theory, 1997
- Acyclic coloring of graphsRandom Structures & Algorithms, 1991
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Acyclic colorings of planar graphsIsrael Journal of Mathematics, 1973
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965