On packing spanning arborescences with matroid constraint

2017-08-01

Additional Metadata
Keywords	connectivity, Edmonds’ branching theorem, matroid, packing arborescences
Persistent URL	doi.org/10.1016/j.endm.2017.06.073
Journal	Electronic Notes in Discrete Mathematics
Organisation	Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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

Publication