A list analogue of equitable coloring
暂无分享,去创建一个
Alexandr V. Kostochka | Douglas B. West | Michael J. Pelsmajer | D. West | A. Kostochka | M. J. Pelsmajer
[1] Ko-Wei Lih,et al. A Note on the m-Bounded Chromatic Number of a Tree , 1993, Eur. J. Comb..
[2] Pierre Hansen,et al. Bounded vertex colorings of graphs , 1990, Discret. Math..
[3] Ko-Wei Lih,et al. EQUITABLE LIST COLORING OF GRAPHS , 2004 .
[4] Ko-Wei Lih,et al. Equitable Coloring and the Maximum Degree , 1994, Eur. J. Comb..
[5] Michael J. Pelsmajer,et al. Equitable list-coloring for graphs of maximum degree 3 , 2004 .
[6] A. Tucker,et al. Perfect Graphs and an Application to Optimizing Municipal Services , 1973 .
[7] Michael J. Pelsmajer. Equitable List Coloring, Induced Linear Forests, and Routing in Rooted Graphs , 2002 .
[8] Richard K. Guy,et al. Monthly Research Problems, 1969–75 , 1975 .
[9] Ko-Wei Lih,et al. Equitable Coloring of Graphs , 1998 .