Structural properties and edge choosability of planar graphs without 4-cycles

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Some structural properties of planar graphs without 4-cycles are investigated. By the structural properties, it is proved that every planar graph G without 4-cycles is edge-(Δ (G) + 1)-choosable, which perfects the result given by Zhang and Wu: If G is a planar graph without 4-cycles, then G is edge-t-choosable, where t = 7 if Δ (G) = 5, and otherwise t = Δ (G) + 1. © 2007 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Shen, Y., Zheng, G., He, W., & Zhao, Y. (2008). Structural properties and edge choosability of planar graphs without 4-cycles. Discrete Mathematics, 308(23), 5789–5794. https://doi.org/10.1016/j.disc.2007.09.048

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free