𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transforming an adjacency matrix into a planar graph

✍ Scribed by R. Hashimshony; E. Shaviv; A. Wachman

Book ID
107962070
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
956 KB
Volume
15
Category
Article
ISSN
0360-1323

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Inserting an Edge into a Planar Graph
Inserting an Edge into a Planar Graph
✍ Carsten Gutwenger; Petra Mutzel; RenΓ© Weiskircher πŸ“‚ Article πŸ“… 2005 πŸ› Springer 🌐 English βš– 325 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.

Decomposing a Planar Graph into an Indep
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 126 KB

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph.