×

Graph with given achromatic number. (English) Zbl 0345.05113


MSC:

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

References:

[1] Hall, P., On representations of subsets, J. London Math. Soc., 10, 26-30 (1935) · Zbl 0010.34503
[2] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0797.05064
[3] Hell, P., Retracts in graphs, (Bari, R. A.; Harary, F., Graphs and Combinatorics. Graphs and Combinatorics, Lecture Notes in Mathematics (1974), Springer: Springer Berlin), 291-301
[4] P. Hell, Bipartite retracts (in preparation).; P. Hell, Bipartite retracts (in preparation).
[5] Hell, P.; Miller, D. J., On forbidden quotients and the achromatic number, (Nash-Williams, C. St. J.A.; Sheehan, J., Proc. 5th British Combinatorial Conf. (1975)), 283-292
[6] Moon, J. W.; Moser, I., On cliques in graphs, Israel J. Math., 3, 23-28 (1965) · Zbl 0144.23205
[7] Sabidussi, G., Graph derivatives, Math. Z., 76, 385-401 (1961) · Zbl 0109.16404
[8] G. Sabidussi, Subdirect representations of graphs, in: Proc. International Colloquium on Infinite and Finite Sets, Keszthely, Hungary, to appear.; G. Sabidussi, Subdirect representations of graphs, in: Proc. International Colloquium on Infinite and Finite Sets, Keszthely, Hungary, to appear. · Zbl 0308.05124
[9] Sumner, D. P., Point determination in graphs, Discrete Math., 5, 179-187 (1973) · Zbl 0265.05124
[10] Sumner, D. P., I-factors of point determining graphs, J. Combin. Theory, 16, B, 35-41 (1974) · Zbl 0284.05121
[11] Hoffman, A. J., Eigenvalues and partitionings of the edges of a graph, Linear Algebra and Appl., 5, 137-146 (1972) · Zbl 0247.05125
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.