A five-color theorem (Q1567630)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A five-color theorem |
scientific article; zbMATH DE number 1462291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A five-color theorem |
scientific article; zbMATH DE number 1462291 |
Statements
A five-color theorem (English)
0 references
15 September 2000
0 references
An edge-face coloring of a plane graph is a function assigning colors to the edges and faces of the graph in such a way that any two elements which are either adjacent or incident receive distinct colors. In this paper it is shown that any plane graph of maximum degree three is edge-face 5-colorable and this bound is sharp.
0 references
planar graph
0 references
edge-face coloring
0 references
