✦ LIBER ✦

Series-parallel subgraphs of planar graphs

✍ Scribed by Ehab S. Elmallah; Charles J. Colbourn

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 435 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220608

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On planar intersection graphs with forbi

On planar intersection graphs with forbidden subgraphs

✍ János Pach; Micha Sharir 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

Connected Spanning Subgraphs of 3-Connec

Connected Spanning Subgraphs of 3-Connected Planar Graphs

✍ Hikoe Enomoto; Tadashi Iida; Katsuhiro Ota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Edges and Kuratowski Subgraphs of Non-Pl

Edges and Kuratowski Subgraphs of Non-Planar Graphs

✍ Jozef Širáň 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

It is proved that any edge of a Pconnected non-planar graph G of order a t least 6 lies in a subdivision of K3,3 in G. For any 3-connected non-planar graph G of order a t least 6 we show that G contains at most four edges which belong to no subdivisions of K3,3 in G.

2-Connected Spanning Subgraphs of Planar

2-Connected Spanning Subgraphs of Planar 3-Connected Graphs

✍ D.W. Barnette 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

Connected subgraphs with small degree su

Connected subgraphs with small degree sums in 3-connected planar graphs

✍ Enomoto, Hikoe; Ota, Katsuhiro 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 2 views

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) ≤ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with