Packing of spanning mixed arborescences
Hui Gao, Daqing Yang · Journal of Graph Theory · 2021
Abstract In this paper, we characterize a mixed graph which contains edge and arc‐disjoint spanning mixed arborescences , such that for each , the cardinality of lies in some prescribed interval. This generalizes both Nash‐Williams and Tutte's theorem on spanning tree packing for undirected graphs and the previous characterization on digraphs which was given by Cai and Frank.