Simultaneously colouring the edges and faces of plane graphs (Q1354728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1006759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simultaneously colouring the edges and faces of plane graphs |
scientific article; zbMATH DE number 1006759 |
Statements
Simultaneously colouring the edges and faces of plane graphs (English)
0 references
3 June 1997
0 references
In a simultaneous colouring of the edges and faces of the plane graph we colour edges and faces so that every two adjacent or incident pair of them receive different colours. In this paper we prove a conjecture of Mel'nikov which states that for this colouring every plane graph can be coloured with \(\Delta+3\) colours, where \(\Delta\) is the maximum degree of a vertex in the graph.
0 references
simultaneous colouring
0 references
plane graph
0 references
0.9587615728378296
0 references
0.9088269472122192
0 references
0.8657820820808411
0 references
0.8630407452583313
0 references
