Simultaneously colouring the edges and faces of plane graphs (Q1354728): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Every planar map is four colorable. II: Reducibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3679212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3784093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3360218 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simultaneous coloring of edges and faces of plane graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615945 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5578803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A six-color theorem for the edge-face coloring of plane graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for total colouring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3115603 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3115277 / rank | |||
Normal rank |
Latest revision as of 12:29, 27 May 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