Title

Coloring Edges Of Graphs Embedded In A Surface Of Characteristics Zero

Abstract

Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this type with maximum degree Δ ≤ 6 are known to exist. Hind and Zhao showed that such graphs with maximum degree Δ ≥ 8 must be class one. This article shows that such graphs with maximum degree Δ = 7 also must be class one, completing the analysis of these surfaces. These are the first surfaces where the maximum degree of class two graphs has been determined. © 2002 Elsevier Science (USA). All rights reserved.

Publication Date

3-1-2003

Publication Title

Journal of Combinatorial Theory. Series B

Volume

87

Issue

2

Number of Pages

254-263

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/S0095-8956(02)00008-4

Socpus ID

0037374156 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS