On the complexity of packing rainbow spanning trees
From MaRDI portal
Publication:2685331
DOI10.1016/j.disc.2022.113297OpenAlexW4313549392MaRDI QIDQ2685331
Tamás Király, Kristóf Bérczi, Gergely Csáji
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11924
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-disjoint rainbow spanning trees in complete graphs
- The edge covering number of the intersection of two matroids
- Linearly many rainbow trees in properly edge-coloured complete graphs
- On the number of rainbow spanning trees in edge-colored complete graphs
- Complexity of packing common bases in matroids
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- Decompositions into isomorphic rainbow spanning trees
- XSAT and NAE-SAT of linear CNF classes
- On Disjoint Common Bases in Two Matroids
- On the Problem of Decomposing a Graph into n Connected Factors
- The intersection of a matroid and a simplicial complex
- On Rota's Basis Conjecture
- Complexity of Matroid Property Algorithms
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Decompositions into spanning rainbow structures
- Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs
- Transversals and matroid partition
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
This page was built for publication: On the complexity of packing rainbow spanning trees
