Simultaneously colouring the edges and faces of plane graphs
type: Item
instance of: scholarly article
title: Simultaneously colouring the edges and faces of plane graphs
zbMATH Open document ID: 0867.05023
author: Adrian O. Waller
published in: Journal of Combinatorial Theory. Series B
publication date: 1997-06-03T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1006759
zbMATH Keywords: simultaneous colouring
zbMATH Keywords: plane graph
MaRDI profile type: Publication
full work available at URL: jctb.1997.1725
OpenAlex ID: W1992500242
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q3679212
cites work: Q3784093
cites work: Q3360218
cites work: Simultaneous coloring of edges and faces of plane graphs
cites work: Q5615945
cites work: Q5578803
cites work: A six-color theorem for the edge-face coloring of plane graphs
cites work: An upper bound for total colouring of graphs
cites work: Ein Sechsfarbenproblem auf der Kugel
cites work: Q3115603
cites work: Q3115277
DOI: 10.1006/JCTB.1997.1725
description: scientific article; zbMATH DE number 1006759