Hits :

First Author : Chen,Yongzhu

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.309

Issue : No.8

Page Number : 2233-2238

ISSN : 0012-365X

Translation or Not : no

Key Words : GRAPH;theory;LINE;geometry;PATHS;&;cycles;(Graph;theory);MAXIMA;&;minima;MATHEMATICAL;analysis;COMPUTER;science;--;Mathematics

Abstract : Let be a plane graph having no 5-cycles with a chord. If either , or and contains no 4-cycles with a chord or no 6-cycles with a chord, then is edge--choosable, where denotes the maximum degree of . [Copyright 2009 Elsevier] Copyright of Discrete Mat