Title

Planar Graphs Of Maximum Degree Seven Are Class I

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.

Publication Date

1-1-2001

Publication Title

Journal of Combinatorial Theory. Series B

Volume

83

Issue

2

Number of Pages

201-212

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1006/jctb.2001.2047

Socpus ID

0035193005 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS