Article

Full entry | PDF   (0.4 MB)
References:
[0] R. L. Brooks: On coloring the nodes of a network. Proc. Cambridge Phil. Soc. 37 (1941), 194-197. MR 0012236
[1] V. Chvátal: The smallest triangle free 4-chromatic 4-regular graph. (To appear). MR 0263691
[2] B. Griünbaum: A problem in graph coloring. (To appear).
[3] F. Harary S. T. Hedetniemi, R. W. Robinson: Uniquely colorable graphs. J. Comb. Th. (1969), 260-270. MR 0238735
[4] F. Harary: Graph theory. Addison Wesley, Reading 1969. MR 0256911 | Zbl 0196.27202
[5] L. Lovász: On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67. MR 0220621
[6] / Nešetřil: $k$-chromatic graphs without cycles of length $\leq 7$. (in Russian) Comment. Math. Univ. Carolinae 7 (1966), 373-376. MR 0201346

Partner of