A uniqueness theorem for edge-chromatic graphs.
J. G. Kalbfleisch
Source: Pacific J. Math. Volume 21, Number 3
(1967), 503-509.
First Page:
Show
Hide
Primary Subjects:
05.55
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.pjm/1102992397
Zentralblatt MATH identifier: 0149.41405
Mathematical Reviews number (MathSciNet): MR0211914
References
[1] Jack E. Graver and James Yackel, Some graph theoretic results associated with Ramsey'stheorem, 1967 (mimeographed).
Mathematical Reviews (MathSciNet): MR37:1278
[2] R. E. Greenwood and A. M. Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1-7.
Mathematical Reviews (MathSciNet): MR16:733g
Zentralblatt MATH: 0064.17901
[3] J. G. Kalbfleisch, Construction of special edge-chromaticgraphs, Canad. Math. Bull. 8 (1965), 575-584.
Mathematical Reviews (MathSciNet): MR33:1248
Zentralblatt MATH: 0132.21205
[4] J. G. Kalbfleisch,Chromatic graphs and Ramsey's theorem, Ph. D. Thesis, University of Waterloo, January, 1966.
[5] J. G. Kalbfleisch, Upper bounds for some Ramsey numbers, (to appear in the Journal of Combinatorial Theory).
Mathematical Reviews (MathSciNet): MR35:2794
Zentralblatt MATH: 0149.41406
[6] G. Kery, Ramsey egy grfelmeleti tetelerol, Matematikai Lapok 15 (1964), 204-224.
Mathematical Reviews (MathSciNet): MR30:2484
Zentralblatt MATH: 0125.40502
[7] F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1930), 264-286.
Zentralblatt MATH: 55.0032.04
Pacific Journal of Mathematics
