Equitable List Coloring of Graphs with Bounded Degree
- 10 December 2012
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (3) , 309-334
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A fast algorithm for equitable coloringCombinatorica, 2010
- Extremal graph packing problems: Ore-type versus Dirac-type2009
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable ColouringCombinatorics, Probability and Computing, 2008
- EQUITABLE LIST COLORING OF GRAPHSTaiwanese Journal of Mathematics, 2004
- Equitable list‐coloring for graphs of maximum degree 3Journal of Graph Theory, 2004
- A list analogue of equitable coloringJournal of Graph Theory, 2003
- Scheduling Computer and Manufacturing Processes2001
- Perfect Graphs and an Application to Optimizing Municipal ServicesSIAM Review, 1973