A six-color theorem for the edge-face coloring of plane graphs (Q1894780)
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 six-color theorem for the edge-face coloring of plane graphs |
scientific article; zbMATH DE number 778544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A six-color theorem for the edge-face coloring of plane graphs |
scientific article; zbMATH DE number 778544 |
Statements
A six-color theorem for the edge-face coloring of plane graphs (English)
0 references
24 July 1995
0 references
The authors show that the set of edges and faces in a plane graph with the maximum degree of vertices not greater than 3 can be properly colored by 6 colors.
0 references
six-color theorem
0 references
edge-face coloring
0 references
plane graph
0 references
0.9142228960990906
0 references
0.8845909237861633
0 references
0.8788495063781738
0 references
0.8779454231262207
0 references
0.8687183856964111
0 references
