Packing of spanning mixed arborescences. Issue 2 (9th June 2021)

• Record Type: Journal Article
• Authors: Gao, Hui; Yang, Daqing
• Is Part Of: Journal of graph theory. Volume 98:Issue 2(2021)
• Page Start: 367
• Page End: 377
• Publication Date: 2021-06-09
• Subjects: arborescence -- digraph -- mixed graph -- packing -- tree; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.22702
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: In this paper, we characterize a mixed graph F which contains k edge and arc‐disjoint spanning mixed arborescences F 1, …, F k, such that for each v ∈ V ( F ), the cardinality of { i ∈ [ k ] : v is the root of F i } 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.