One-to-one disjoint path covers in hypercubes with faulty edges

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs

“…In addition, they have applications in several areas such as software testing, database design and code optimization [16]. Therefore, these problems have attracted much attention from researchers [2,3,9,10,11,13,14,17,18,19,23,24,26]. In this paper, we will focus on the following three types of disjoint path cover problems in digraphs: many-to-many k-DDPC problem, one-to-many k-DDPC problem and one-to-one k-DDPC problem.…”