2 papers
math.CO2026
Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
Shanshan Yu, Yuefang Sun
Let be a digraph with a terminal vertex subset such that . An out-tree of rooted at is called a directed pendant -…
math.CO2024
Degree conditions for disjoint path covers in digraphs
Ansong Ma, Yuefang Sun
In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many -DDPC, one-to-many -DDPC and one-to-one -DDPC, which are i…