A five-color theorem
type: Item
instance of: scholarly article
title: A five-color theorem
zbMATH Open document ID: 0944.05035
DOI: 10.1016/S0012-365X(00)00032-7
author: Daniel P. Sanders
author: Yue Zhao
published in: Discrete Mathematics
publication date: 2000-09-15T00:00:00Z
review text: An edge-face coloring of a plane graph is a function assigning colors to the edges and faces of the graph in such a way that any two elements which are either adjacent or incident receive distinct colors. In this paper it is shown that any plane graph of maximum degree three is edge-face 5-colorable and this bound is sharp.
reviewed by: Ioan Tomescu
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1462291
zbMATH Keywords: planar graph
zbMATH Keywords: edge-face coloring
MaRDI profile type: Publication
full work available at URL: s0012-365x(00)00032-7
OpenAlex ID: W1963898880
description: scientific article; zbMATH DE number 1462291