A seven-color theorem on edge-face coloring of plane graphs (Q5946678)
From MaRDI portal
scientific article; zbMATH DE number 1659377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A seven-color theorem on edge-face coloring of plane graphs |
scientific article; zbMATH DE number 1659377 |
Statements
A seven-color theorem on edge-face coloring of plane graphs (English)
0 references
30 June 2002
0 references
It is shown that seven colours are enough for simultaneous colouring the edges and faces of plane graphs so that any two adjacent or incident elements are coloured differently. It confirmes Melnikov's conjecture for plane graphs with maximum vertex degree four.
0 references
simultaneous colouring
0 references
