Simultaneously colouring the edges and faces of plane graphs (Q1354728): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1997.1725 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992500242 / rank | |||
Normal rank | |||
Revision as of 22:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simultaneously colouring the edges and faces of plane graphs |
scientific article |
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
