Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649984 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
Some structural properties of planar graphs without 4-cycles are investigated. By the structural properties, it is proved that every planar graph GG without 4-cycles is edge -(Δ(G)+1)(Δ(G)+1)-choosable , which perfects the result given by Zhang and Wu: If GG is a planar graph without 4-cycles, then GG is edge -tt-choosable , where t=7t=7 if Δ(G)=5Δ(G)=5, and otherwise t=Δ(G)+1t=Δ(G)+1.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yufa Shen, Guoping Zheng, Wenjie He, Yongqiang Zhao,