| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654349 | European Journal of Combinatorics | 2009 | 4 Pages |
Abstract
This note gives a short proof on characterizations for a forest to be equitably k-colorable.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gerard J. Chang,