✦ LIBER ✦

Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs

✍ Scribed by Haruko Okamura

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths containing two adjacent edges in (

✍ Haruko Okamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Longest paths joining given vertices in

✍ H. A. Jung 📂 Article 📅 1986 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 590 KB

2-Reducible Two Paths and an Edge Constr

✍ Haruko Okamura 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 606 KB

Cycles and paths through specified verti

✍ Y Egawa; R Glas; S.C Locke 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Cycles through k+2 vertices in k-connect

✍ N. Tsikopoulos 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB