✦ LIBER ✦

The surviving rate of planar graphs

✍ Scribed by Jiangxu Kong; Weifan Wang; Xuding Zhu

Book ID: 113927566
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 257 KB
Volume: 416
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The 2-surviving rate of planar graphs wi

The 2-surviving rate of planar graphs without 4-cycles

✍ Wang, Weifan; Kong, Jiangxu; Zhang, Lianzhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On random planar graphs, the number of p

On random planar graphs, the number of planar graphs and their triangulations

✍ Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 219 KB

The Surviving Rate of a Graph for the Fi

The Surviving Rate of a Graph for the Firefighter Problem

✍ Leizhen, Cai; Weifan, Wang 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 213 KB

Convex drawings of hierarchical planar g

Convex drawings of hierarchical planar graphs and clustered planar graphs

✍ Seok-Hee Hong; Hiroshi Nagamochi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Generalizations of planar graphs

✍ Ranel E. Erickson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 677 KB

Choosability of planar graphs

✍ Margit Voigt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A graph G = G(EE) with lists L(v), associated with its vertices v E V, is called L-list colourable if there is a proper vertex colouring of G in which the colour assigned to a vertex v is chosen from L(v). We say G is k-choosable if there is at least one L-list colouring for every possible list assi