✦ LIBER ✦

Finding k Disjoint Paths in a Directed Planar Graph

✍ Scribed by Schrijver, Alexander

Book ID: 118177314
Publisher: Society for Industrial and Applied Mathematics
Year: 1994
Tongue: English
Weight: 976 KB
Volume: 23
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539792224061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved algorithms for finding length-b

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Disjoint Paths in a Planar Graph—A Gener

Disjoint Paths in a Planar Graph—A General Theorem

✍ Ding, Guoli; Schrijver, A.; Seymour, P. D. 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 521 KB

Edge-disjoint paths in planar graphs

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

Finding an Even Simple Path in a Directe

Finding an Even Simple Path in a Directed Planar Graph

✍ Nedev, Zhivko Prodanov 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 302 KB

Edge-disjoint homotopic paths in a plana

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

✍ C van Hoesel; A Schrijver 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 967 KB

Disjoint directed quadrilaterals in a di

Disjoint directed quadrilaterals in a directed graph

✍ Danhong Zhang; Hong Wang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__ − 2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc. J Graph Theory