Planar graphs of maximum degree seven are class I

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 2, 2001, Pages 201-212

  Sanders, Daniel P ^a   Zhao, Yue ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035193005     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2047     Document Type: Article

References (6)

1. The four-colour theorem
2. On total 9-coloring planar graphs of maximum degree seven
3. On improving the edge-face coloring theorem
4. On an estimate of the chromatic index of a p-graph
5. Critical graphs with given chromatic index