A one-to-one k-disjoint directed path cover (k-DDPC for short) of a digraph D is a set of k disjoint directed paths joining source with sink that cover all the vertices of the digraph. Let delta(0)(D) := min{delta(+) (D), delta(-) (D)) be the minimum semi-degree of D. We show that every digraph D of sufficiently large order n with delta(0)(D) >= [(n + k + 1)/2] contains a one-to-one k-DDPC for any given one distinct source-sink. The undirected version and a One-type degree conditions of this result was proved earlier [1]. (C) 2017 Elsevier B.V. All rights reserved.
机构:
Univ Rochester, William E Simon Grad Sch Business Adm, Rochester, NY 14627 USAUniv Rochester, William E Simon Grad Sch Business Adm, Rochester, NY 14627 USA
Shaffer, G
Zhang, ZJ
论文数: 0引用数: 0
h-index: 0
机构:Univ Rochester, William E Simon Grad Sch Business Adm, Rochester, NY 14627 USA
机构:
Corvinus Univ Budapest, Dept Math, 13-15 Fovamter, H-1093 Budapest, HungaryCorvinus Univ Budapest, Dept Math, 13-15 Fovamter, H-1093 Budapest, Hungary
Kannai, Zoltan
AMERICAN MATHEMATICAL MONTHLY,
2017,
124
(08):
: 746
-
748