✦ LIBER ✦

On 3-choosability of triangle-free plane graphs

✍ Scribed by YingQian Wang; QiJun Zhang

Publisher: SP Science China Press
Year: 2011
Tongue: English
Weight: 234 KB
Volume: 54
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-011-4191-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coupled choosability of plane graphs

✍ Weifan Wang; Ko-Wei Lih 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A plane graph __G__ is coupled __k__‐choosable if, for any list assignment __L__ satisfying $|{{L}}({{x}})|= {{k}}$ for every ${{x}}\in {{V}}({{G}})\cup {{F}}({{G}})$, there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incid

On 3-choosability of plane graphs withou

On 3-choosability of plane graphs without 6-, 7- and 9-cycles

✍ Haihui Zhang; Baogang Xu 📂 Article 📅 2004 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 354 KB

Choosability of K5-minor-free graphs

✍ Riste Sˇkrekovski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

On triangle-free random graphs

✍ Tomasz Łuczak 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 3 views

We show that for every k ≥ 1 and δ > 0 there exists a constant c > 0 such that, with probability tending to 1 as n → ∞, a graph chosen uniformly at random among all triangle-free graphs with n vertices and M ≥ cn 3/2 edges can be made bipartite by deleting δM edges. As an immediate consequence of th

On triangle-free projective graphs

✍ S. Hazan 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 608 KB

On Structure of Some Plane Graphs with A

On Structure of Some Plane Graphs with Application to Choosability

✍ Peter Che Bor Lam; Wai Chee Shiu; Baogang Xu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles