✦ LIBER ✦

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

✍ Scribed by Zhang, Shurong; Wang, Shiying

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paired many-to-many disjoint path covers

✍ Jo, Shinhaeng; Park, Jung-Heum; Chwa, Kyung-Yong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Paired many-to-many disjoint path covers

✍ Chen, Xie-Bin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Many-to-many two-disjoint path covers in

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

Paired many-to-many disjoint path covers

✍ Xie-Bin Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Edge disjoint Hamiltonian cycles in k-ar

✍ Bae, M.M.; Bose, B. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 580 KB

Constructing one-to-many disjoint paths

✍ Cheng-Nan Lai; Gen-Huey Chen; Dyi-Rong Duh 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 418 KB