Hits :

First Author : Weifan Wang

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

Date of Publication : 2005-01-01

Document Type : 期刊

Journal : Science in China, Series A: Mathematics, Physics, Astronomy

Volume: Vol.48

Issue : No.11

Page Number : 1531-1544

ISSN : 1001-6511

Translation or Not : no

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

Abstract : In this paper we prove that ifG is a planar graph with Δ = 5 and without 4-cycles or 6-cycles, thenG is edge-6-choosable. This consequence together with known results show that, for each fixedk ? {3,4,5,6}, ak-cycle-free planar graphG is edge-(Δ + 1)-choo