Daqing Yang

activity

20162022

most citedOn coloring numbers of graph powers

8 citations · 25 across the 13 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020★ 7 cited

Packing of spanning mixed arborescences

Hui Gao, Daqing Yang

In this paper, we characterize a mixed graph $F$ which contains $k$ edge and arc disjoint spanning mixed arborescences $F_{1}, \dots, F_{k}$ , such that for each $v \in V (F)$ , the…

math.CO2020★ 6 cited

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 $D = (V, A)$ , a matr…