Title of article
A Note on the m-Bounded Chromatic Number of a Tree
Author/Authors
Chen، نويسنده , , Bor-Liang and Lih، نويسنده , , Ko-Wei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
2
From page
311
To page
312
Abstract
The m-bounded chromatic number of a graph G is the smallest number of colors required for a proper coloring of G in which each color is used at most m times. We will establish an exact formula for the m -bounded chromatic number of a tree.
Journal title
European Journal of Combinatorics
Serial Year
1993
Journal title
European Journal of Combinatorics
Record number
1547889
Link To Document