Title

Coloring Edges Of Embedded Graphs

Keywords

Class one and class two; Edge colorings

Abstract

In this paper, we prove that any graph G with maximum degree A(G) ≥ (11+√49-24χ(Σ))/2, which is embeddable in a surface Σ of characteristic χ(Σ) ≤ 1 and satisfies |V(G)| > 2(Δ(G)-5)-2√6+Δ(G), is class one. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 197-205, 2000.

Publication Date

1-1-2000

Publication Title

Journal of Graph Theory

Volume

35

Issue

3

Number of Pages

197-205

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/1097-0118(200011)35:3<197::AID-JGT5>3.0.CO;2-1

Socpus ID

0034365989 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS