Journal ArticleOPEN ACCESS

Planar graphs of maximum degree seven are class I

Journal of Combinatorial Theory. Series B (2001) 83(2) 201-212
DOI: 10.1006/jctb.2001.2047
144Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In 1965, Vizing proved that planar graphs of maximum degree at least eight have the edge chromatic number equal to their maximum degree. He conjectured the same if the maximum degree is either six or seven. This article proves the maximum degree seven case. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Sanders, D. P., & Zhao, Y. (2001). Planar graphs of maximum degree seven are class I. Journal of Combinatorial Theory. Series B, 83(2), 201–212. https://doi.org/10.1006/jctb.2001.2047

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