✦ LIBER ✦

Untangling a Planar Graph

✍ Scribed by Xavier Goaoc; Jan Kratochvíl; Yoshio Okamoto; Chan-Su Shin; Andreas Spillner; Alexander Wolff

Publisher: Springer
Year: 2009
Tongue: English
Weight: 829 KB
Volume: 42
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-008-9130-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Untangling Polygons and Graphs

✍ Josef Cibulka 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 381 KB

A Polynomial Bound for Untangling Geomet

A Polynomial Bound for Untangling Geometric Planar

✍ Prosenjit Bose; Vida Dujmović; Ferran Hurtado; Stefan Langerman; Pat Morin; Davi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 516 KB

On cleaving a planar graph

✍ Shankar M. Venkatesan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Quickly Excluding a Planar Graph

✍ N. Robertson; P. Seymour; R. Thomas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

A non-Hamiltonian planar graph

✍ W. T. Tutte 📂 Article 📅 1960 🏛 Akadmiai Kiad 🌐 English ⚖ 211 KB

Decomposing a Planar Graph into Degenera

Decomposing a Planar Graph into Degenerate Graphs

✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

We prove the conjecture made by \(\mathrm{O}\). V. Borodin in 1976 that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph. that is, a forest. c. 1995 Academic Press. Inc.