✦ LIBER ✦

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

✍ Scribed by Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 218 KB
Volume: 141
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0229-w

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Simultaneous coloring of edges and faces

Simultaneous coloring of edges and faces of plane graphs

✍ Oleg V. Borodin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 888 KB

The edges and faces of a plane graph are colored so that every two adjacent or incident of them are colored differently. The minimal number of colors for this kind of coloring is estimated. For the plane graphs of the maximal degree at least 10, the bound is the best possible. The proof is based on

Edge-face coloring of plane graphs with

Edge-face coloring of plane graphs with maximum degree nine

✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

The number of edge 3-colorings of a plan

The number of edge 3-colorings of a planar cubic graph as a permanent

✍ David E. Scheim 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 370 KB

In this paper, we establish that the number of edge 3-colorings of a finite planar cubic graph G, i.e., 3-colorings of its interchange graph H, is equal to 2\*lPermanent(A)l, where N is the number of edges of G, and A is the 2N X 2iV square matrix formed by repeating each row of the N X 2N vertexdir

On the edge-coloring problem for a class

On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract A (plane) 4‐regular map __G__ is called __C__‐simple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case σ (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves

Erratum: On the edge-coloring problem fo

Erratum: On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB 👁 1 views

On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following