✦ LIBER ✦

Fire Containment in Planar Graphs

✍ Scribed by Louis Esperet; Jan van den Heuvel; Frédéric Maffray; Félix Sipma

Book ID: 112121135
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 624 KB
Volume: 73
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Containment relations in split graphs

✍ Petr A. Golovach; Marcin Kamiński; Daniël Paulusma; Dimitrios M. Thilikos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 289 KB

-separators in planar graphs

✍ S.A. Tishchenko 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Subdivisions in Planar Graphs

✍ Xingxing Yu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Given four distinct vertices in a 4-connected planar graph G, we characterize when the graph G contains a K 4 -subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no K 4 -subdivision wi

max-cut and containment relations in gra

max-cut and containment relations in graphs

✍ Marcin Kamiński 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Even circuits in planar graphs

✍ P.D Seymour 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Packing paths in planar graphs

✍ András Frank 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB