Document Zbl 0465.05032

Generalized k-tuple colorings of cycles and other graphs. (English) Zbl 0465.05032

J. Comb. Theory, Ser. B 32, 90-94 (1982).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0465.05032

MSC:

05C15	Coloring of graphs and hypergraphs
05C35	Extremal problems in graph theory

Keywords:

multicoloring

Cite Review PDF

Full Text: DOI

References:

[1]	Bolobás, B.; Thomason, A., Set colourings of graphs, Discrete Math., 25, 21-26 (1979) · Zbl 0403.05038
[2]	Brigham, R. C.; Dutton, R. D., (Generalized \(k\)-tuple Colorings of a Graph (1980), University of Central Florida, Department of Computer Science), Technical report CS-TR-50
[3]	Deza, M., Solution d’un problème de Erdös-Lovász, J. Combin. Theory Ser. B, 16, 166-167 (1974) · Zbl 0263.05007
[4]	Hall, M., (Combinatorial Theory (1967), Ginn (Blaisdell): Ginn (Blaisdell) Waltham, Mass) · Zbl 0196.02401
[5]	Nordhaus, E. A.; Gaddum, J. W., On complementary graphs, Amer. Math. Monthly, 63, 175-177 (1956) · Zbl 0070.18503
[6]	Orlin, J., Contentment in graph theory: Covering graphs with cliques, (Proc. K. Ned. Akad. Wet. Ser. A, 80 (1977)), 406-424 · Zbl 0374.05041
[7]	Stahl, S., \(n\)-tuple colorings and associated graphs, J. Combin. Theory Ser. B, 20, 185-203 (1976) · Zbl 0293.05115

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.