Hits :

First Author : WANG

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

Date of Publication : 2005-01-01

Document Type : 期刊

Journal : 中国科学(A辑)(英文版)

Volume: 第48卷

Issue : 第11期

Page Number : 1531-1544

ISSN : 1674-7283

Translation or Not : no

Key Words : planar；graph；coloring；choosability；cycle

Abstract : In this paper we prove that if G is a planar graph with △ = 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known (△ + 1)-choosable, where△ denotes the maximum degree of G.