๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on edge-choosability of planar graphs without intersecting 4-cycles

โœ Scribed by Qiaoling Ma; Jihui Wang; Jiansheng Cai; Sumei Zhang

Book ID
107620045
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
294 KB
Volume
36
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Choosability and edge choosability of pl
Choosability and edge choosability of planar graphs without five cycles
โœ Weifan Wang; Ko-Wei Lih ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 402 KB

## It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)-h

Acyclic 5-choosability of planar graphs
Acyclic 5-choosability of planar graphs without adjacent short cycles
โœ O. V. Borodin; A. O. Ivanova ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy