✦ LIBER ✦

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

✍ Scribed by Yufa Shen; Guoping Zheng; Wenjie He; Yongqiang Zhao

Book ID: 108113926
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 288 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.048

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

A note on edge-choosability of planar gr

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

✍ Qiaoling Ma; Jihui Wang; Jiansheng Cai; Sumei Zhang 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

Planar graphs without 4-cycles are acycl

Planar graphs without 4-cycles are acyclically 6-choosable

✍ Weifan Wang; Min Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract A proper vertex coloring of a graph __G__=(__V, E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__={__L__(__v__)|__v__∈__V__}, there exists a proper acyclic coloring π of __G__ such that π(__v__)∈_

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without small cycles

✍ Mickaël Montassier; André Raspaud; Weifan Wang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V,E__) is acyclic if __G__ contains no bicolored cycle. A graph __G__ is acyclically __L__‐list colorable if for a given list assignment __L__ = {__L__(__v__): __v__: ∈ __V__}, there exists a proper acyclic coloring ϕ of __G__ such that ϕ(_

On 3-choosability of planar graphs witho

On 3-choosability of planar graphs without certain cycles

✍ Haihui Zhang; Zhiren Sun 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 131 KB

The 4-Choosability of Plane Graphs witho

The 4-Choosability of Plane Graphs without 4-Cycles

✍ Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosa