Title of article
Edge choosability of planar graphs without 5-cycles with a chord
Author/Authors
Chen، نويسنده , , Yongzhu and Zhu، نويسنده , , Weiyi and Wang، نويسنده , , Weifan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
2233
To page
2238
Abstract
Let G be a plane graph having no 5-cycles with a chord. If either Δ ≥ 6 , or Δ = 5 and G contains no 4-cycles with a chord or no 6-cycles with a chord, then G is edge- ( Δ + 1 ) -choosable, where Δ denotes the maximum degree of G .
Keywords
plane graph , cycle , Chord , Edge choosability
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598693
Link To Document