✦ LIBER ✦

Disjoint path covers in cubes of connected graphs

✍ Scribed by Park, Jung-Heum; Ihm, Insung

Book ID: 122175851
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 460 KB
Volume: 325
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.02.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-source three-disjoint path covers

Single-source three-disjoint path covers in cubes of connected graphs

✍ Park, Jung-Heum; Ihm, Insung 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Many-to-many disjoint path covers in k-a

Many-to-many disjoint path covers in k-ary n-cubes

✍ Zhang, Shurong; Wang, Shiying 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Short Disjoint Paths in Locally Connecte

Short Disjoint Paths in Locally Connected Graphs

✍ Chuanping Chen; Roman Čada; Tomáš Kaiser; Zdeněk Ryjáček 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 185 KB

Edge Disjoint Paths in Moderately Connec

Edge Disjoint Paths in Moderately Connected Graphs

✍ Rao, Satish; Zhou, Shuheng 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 424 KB

Many-to-many two-disjoint path covers in

Many-to-many two-disjoint path covers in restricted hypercube-like graphs

✍ Kim, Sook-Yeon; Park, Jung-Heum 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Edge-disjoint paths and cycles in n-edge

Edge-disjoint paths and cycles in n-edge-connected graphs

✍ Andreas Huck 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l ≥ 0 let g(k, l) be the minimal __n__ ≥ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a