×

Equitable and proportional coloring of trees. (English) Zbl 0498.05027


MSC:

05C15 Coloring of graphs and hypergraphs
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berge, C.; Sterboul, F., Equipartite colorings in graphs and hypergraphs, J. Combin. Theory Ser. B, 22, 97-113 (1977) · Zbl 0353.05035
[2] Bollobás, B., (Extremal Graph Theory (1978), Academic Press: Academic Press New York/London) · Zbl 0419.05031
[3] Corrádi, K.; Hajnal, A., On the maximum number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar., 14, 423-439 (1963) · Zbl 0118.19001
[4] Guy, Richard, Monthly research problems, 1969-1975, Amer. Math. Monthly, 82, 995-1004 (1975), esp. pp. 998-999 · Zbl 0334.00006
[5] Hajnal, A.; Szemerédi, E., Proof of a conjecture of Erdős, (Erdős, P.; Rényi, A.; Sós, V. T., Combinatorial Theory and Its Applications, II. Combinatorial Theory and Its Applications, II, Colloq. Math. Soc. J. Bolyai, Vol. 4 (1970), North-Holland: North-Holland Amsterdam), 601-623 · Zbl 0217.02601
[6] Meyer, Walter, Equitable coloring, Amer. Math. Monthly, 80, 920-922 (1973) · Zbl 0279.05106
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.