The following publications are possibly variants of this publication:
- Many-to-many Disjoint Path Covers in a Graph with Faulty ElementsJung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim. isaac 2004: 742-753 [doi]
- One-to-Many Disjoint Path Covers in a Graph with Faulty ElementsJung-Heum Park. cocoon 2004: 392-401 [doi]
- Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty ElementsJung-Heum Park. access, 10:127589-127600, 2022. [doi]
- Many-to-Many Disjoint Path Covers in the Presence of Faulty ElementsJung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim. TC, 58(4):528-540, 2009. [doi]
- On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elementsJung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim. ipps 2008: 1-8 [doi]
- Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty ElementsJung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim. tpds, 17(3):227-240, 2006. [doi]
- Disjoint path covers in recursive circulants G(2:::m:::, 4) with faulty elementsSook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park. TCS, 412(35):4636-4649, 2011. [doi]
- Paired many-to-many disjoint path covers in faulty hypercubesShinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa. TCS, 513:1-24, 2013. [doi]