Title of article
Choosability and edge choosability of planar graphs without five cycles Original Research Article
Author/Authors
Weifan Wang، نويسنده , , Ko-Wei Lih، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
561
To page
565
Abstract
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(Δ(G) + 1)-choosable.
Keywords
Choosability , Edge choosability , degeneracy , Planar graph.
Journal title
Applied Mathematics Letters
Serial Year
2002
Journal title
Applied Mathematics Letters
Record number
897382
Link To Document