Additional Metadata
Keywords connectivity, Edmonds’ branching theorem, matroid, packing arborescences
Persistent URL dx.doi.org/10.1016/j.endm.2017.06.073
Journal Electronic Notes in Discrete Mathematics
Citation
Fortier, Q, Király, C, Szigeti, Z, & Tanigawa, S.-I. (2017). On packing spanning arborescences with matroid constraint. Electronic Notes in Discrete Mathematics, 61, 451–457. doi:10.1016/j.endm.2017.06.073