Hits :

First Author : Shu, Qiaojun

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.313

Issue : No.3

Page Number : 301-311

ISSN : 0012-365X

Translation or Not : no

Key Words : Acyclic;list;edge;coloring;Outerplanar;graphs;Maximum;degree

Abstract : An acyclic list edge coloring of a graph is a proper list edge coloring such that no bichromatic cycles are produced. In this paper, we prove that an outerplanar graph with maximum degree has the acyclic list edge chromatic number equal to .