Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

A 4-Color Theorem for Toroidal Graphs

Hudson V. Kronk and Arthur T. White
Proceedings of the American Mathematical Society
Vol. 34, No. 1 (Jul., 1972), pp. 83-86
DOI: 10.2307/2037902
Stable URL: http://www.jstor.org/stable/2037902
Page Count: 4
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A 4-Color Theorem for Toroidal Graphs
Preview not available

Abstract

It is well known that any graph imbedded in the torus has chromatic number at most seven, and that seven is attained by the graph $K_7$. In this note we show that any toroidal graph containing no triangles has chromatic number at most four, and produce an example attaining this upper bound. The results are then extended for arbitrary girth.

Page Thumbnails

  • Thumbnail: Page 
83
    83
  • Thumbnail: Page 
84
    84
  • Thumbnail: Page 
85
    85
  • Thumbnail: Page 
86
    86