On packing spanning arborescences with matroid constraint
From MaRDI portal
Publication:5110654
DOI10.1002/jgt.22484zbMath1495.05157OpenAlexW2968781010WikidataQ127373539 ScholiaQ127373539MaRDI QIDQ5110654
Zoltán Szigeti, Quentin Fortier, Csaba Király, Shin-ichi Tanigawa
Publication date: 21 May 2020
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22484
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
This page was built for publication: On packing spanning arborescences with matroid constraint
