Equitable and proportional coloring of trees
暂无分享，去创建一个
Abstract We show that almost all trees can be equitably 3-colored, that is, with three color classes of cardinalities differing by at most one. Also, except in some extreme cases, they can be 3-colored with color classes of sizes in given proportions.
[1] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .
[2] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[3] Claude Berge,et al. Equipartite colorings in graphs and hypergraphs , 1977, J. Comb. Theory, Ser. B.
[4] Richard K. Guy,et al. Monthly Research Problems, 1969–75 , 1975 .