IMPORTANT NOTICE

The AMS website will be down for maintenance on May 23 between 6:00am - 8:00am EDT. For questions please contact AMS Customer Service at cust-serv@ams.org or (800) 321-4267 (U.S. & Canada), (401) 455-4000 (Worldwide).

 

Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

 
 

 

The entire chromatic number of a normal graph is at most seven


Authors: Hudson V. Kronk and John Mitchem
Journal: Bull. Amer. Math. Soc. 78 (1972), 799-800
MSC (1970): Primary 0555
DOI: https://doi.org/10.1090/S0002-9904-1972-13041-6
MathSciNet review: 0302488
Full-text PDF

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • 1. H. Izbicki, "Verallgemeinerte Farbenzahlen, " Beiträge zur Graphentheorie, H. Sachs, H. Voss and H. Walther (Editors), Teubner, Leipzig, 1968, pp. 81-84. MR 241305
  • 2. G. Ringel, Ein Sechsfarbenproblem auf der Kugel, Abh. Math. Sem. Univ. Hamburg 29 (1965), 107-117. MR 32 #4685. MR 187232

Similar Articles

Retrieve articles in Bulletin of the American Mathematical Society with MSC (1970): 0555

Retrieve articles in all journals with MSC (1970): 0555


Additional Information

DOI: https://doi.org/10.1090/S0002-9904-1972-13041-6

American Mathematical Society