5 papers · 1 filter
Digraph analogues for the Nine Dragon Tree Conjecture
Hui Gao, Daqing Yang
The fractional arboricity of a digraph , denoted by , is defined as . Frank in [Covering branching, Acta S…
Packing of spanning mixed arborescences
Hui Gao, Daqing Yang
In this paper, we characterize a mixed graph which contains edge and arc disjoint spanning mixed arborescences , such that for each , the…
Packing of maximal independent mixed arborescences
Hui Gao, Daqing Yang
Király in [On maximal independent arborescence packing, SIAM J. Discrete. Math. 30 (4) (2016), 2107-2114] solved the following packing problem: Given a digraph , a matr…
Packing branchings under cardinality constraints on their root sets
Hui Gao, Daqing Yang
Edmonds' fundamental theorem on arborescences characterizes the existence of pairwise arc-disjoint spanning arborescences with prescribed root sets in a digraph. In this paper,…
Two bounds for generalized -connectivity of Cartesian product graphs
Hui Gao, Benjian Lv, Kaishun Wang
The generalized -connectivity of a graph , which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let and $H…