This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
V. Chvátal, The smallest triangle-free 4-chromatic 4-regular graph, J. Combinatorial Theory 9 (1970), 93–94.
B. Descartes (pseudonym of Tutte), A three color problem, Eureka (April 1947); Solution (March 1948).
G. Dirac, A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proc. London Math. Soc. (3) 7 (1957), 161–195.
P. Erdös, Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.
B. Grötzsch, Ein Driefarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin — Luther Univ., Halle-Wittenberg, Math. Nat. Reihe 8 (1958.59), 109–120.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
H. Kronk and A. white, A 4-color theorem for toroidal graphs, Proc. Amer. Math. Soc., to appear.
J. Mycielski, Sur le coloriage des graphs, Colloq. Math. 3 (1955), 161–162.
A. A. Zykov, On some properties of linear complexes, Math. Sb. 24 (1949), 163–188.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this paper
Cite this paper
Kronk, H.V. (1972). The chromatic number of triangle-free graphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds) Graph Theory and Applications. Lecture Notes in Mathematics, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067369
Download citation
DOI: https://doi.org/10.1007/BFb0067369
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06096-3
Online ISBN: 978-3-540-38114-3
eBook Packages: Springer Book Archive
