Title

A Five-Color Theorem

Abstract

In this note, we show that the edges and faces of any plane graph with maximum degree three can be simultaneously colored with five colors. © 2000 Elsevier Science B.V. All rights reserved.

Publication Date

6-6-2000

Publication Title

Discrete Mathematics

Volume

220

Issue

1-3

Number of Pages

279-281

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0012-365X(00)00032-7

Socpus ID

0347016230 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0347016230

This document is currently not available here.

Share

COinS