✦ LIBER ✦

Edge-disjoint homotopic paths in a planar graph with one hole

✍ Scribed by C van Hoesel; A Schrijver

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 967 KB
Volume: 48
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90131-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 KB

Edge-Disjoint (s, t)-Paths in Undir

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

✍ Karsten Weihe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

We consider the following problem. Let G s V, E be an undirected planar graph and let s, t g V, s / t. The problem is to find a set of pairwise edge-disjoint paths in G, each connecting s with t, of maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fast

Paths and Metrics in a Planar Graph with

Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths

✍ A.V. Karzanov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Recognition algorithm for intersection g

Recognition algorithm for intersection graphs of edge disjoint paths in a tree

✍ B.S. Panda; S.P. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A theorem on paths in planar graphs

✍ Norishige Chiba; Takao Nishizeki 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

C. Thomassen extended Tutte's theorem on cycles in planar graphs in the paper "A Theorem on Paths in Planar Graphs". This note corrects a flaw in his proof.

A theorem on paths in planar graphs

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer (51 asserting that every 4-connected planar graph is Hamiltonian-connected.