✦ LIBER ✦

A 4-color theorem for the Klein Bottle

✍ Scribed by R. Louise Woodburn

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 449 KB
Volume: 76
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90324-5

No coin nor oath required. For personal study only.

✦ Synopsis

Any graph imbedded on the Klein Bottle has a chromatic number of at most 6. Here we show that if the graph has no triangles, then its chromatic number is at most 4. The results for arbitrary girth are also included, 2s well as graphs which show all but one of these bounds to be best possible. These bounds are then extended to the real projective plane.

📜 SIMILAR VOLUMES

Disjoint circuits on a Klein bottle and

Disjoint circuits on a Klein bottle and a theorem on posets

✍ Guoli Ding 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 694 KB

Ding, G., Disjoint circuits on a Klein bottle and a theorem on posets, Discrete Mathematics 112 (1993) 81-91. In this paper, we consider the problem of packing disjoint directed circuits in a digraph drawn on the Klein bottle or on the torus. We formulate a problem on posets which unifies all the p

4-Regular Maps on the Klein Bottle

✍ Han Ren; Yanpei Liu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 245 KB

The Signed Chromatic Number of the Proje

The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring

✍ T. Zaslavsky 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A six-color theorem for the edge-face co

A six-color theorem for the edge-face coloring of plane graphs

✍ Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 218 KB

It was shown (Kronk and Mitchen, 1973) that the set of vertices, edges and faces of any normal map on the sphere can be colored with seven colors. In this paper we solve a somewhat different problem: the set of edges and faces of any plane graph with A ~< 3 can be colored by six colors.

A digest of the four color theorem

✍ Frank R. Bernhart 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

## Abstract A major event in 1976 was the announcement that the Four Color Conjecture (4CC) had at long last become the Four Color Theorem (4CT). The proof by W. Haken, K. Appel, and J. Koch is published in the __Illinois Journal of Mathematics__, and their two‐part article outlines the nature and

A seven-color theorem on the sphere

✍ Hudson V. Kronk; John Mitchem 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Ringel has shown that the set of vertices and regions of any norm:4 map on the sphere can be admissibly colored by six colors. In this paper, it is shown that the set of vertices, edges and regions of any normd map on the sphere tit? be admissibly colored with seven colors.