On the complexity of packing rainbow spanning trees
From MaRDI portal
Publication:6402998
DOI10.1016/j.disc.2022.113297zbMath1508.05136arXiv2206.11924MaRDI QIDQ6402998
Tamás Király, Kristóf Bérczi, Gergely Csáji
Publication date: 23 June 2022
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: On the complexity of packing rainbow spanning trees