List-Edge-Coloring with Bounded Maximum Degree

Abstract: For a graph

G

, we show that if

m a d (G) < m

, then

c h i'_{e} l l (G) l e q D e l t a + 1

where

m

depends upon

D e l t a

and

c h i'_{e} l l (G)

is the list-chromatic index of

G

. When

D e l t a l e q 20

the value of

m

is close to

f r a c 12 D e l t a

, but as

D e l t a

increases

m

becomes asymptotic to about

f r a c 14 D e l t a + 5

.

This page was built for publication: List-Edge-Coloring with Bounded Maximum Degree