A five-color theorem

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Sanders, D. P., & Zhao, Y. (2000). A five-color theorem. Discrete Mathematics, 220(1–3), 279–281. https://doi.org/10.1016/S0012-365X(00)00032-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free