Choosability and edge choosability of planar graphs without five cycles

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

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. © 2002 Elsevier Science Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Wang, W., & Lih, K. W. (2002). Choosability and edge choosability of planar graphs without five cycles. Applied Mathematics Letters, 15(5), 561–565. https://doi.org/10.1016/S0893-9659(02)80007-6

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