Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
From MaRDI portal
Publication:1727772
DOI10.1016/j.disc.2018.11.026zbMath1405.05146OpenAlexW2908501301WikidataQ114190693 ScholiaQ114190693MaRDI QIDQ1727772
Gloria Rinaldi, Giuseppe Mazzuoccolo
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.11.026
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-disjoint rainbow spanning trees in complete graphs
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Symmetric 1-factorizations of the complete graph
- \(k\)-pyramidal one-factorizations
- Cyclic one-factorization of the complete graph
- Rainbow spanning trees in properly coloured complete graphs
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
- Frattini-based starters in 2-groups
- Primitive one-factorizations and the geometry of mixed translations
- Quaternionic starters
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Multicolored Isomorphic Spanning Trees in Complete Graphs
- One-factorizations of the complete graph—A survey
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Nilpotent 1-factorizations of the complete graph
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Abelian 1-factorizations of the complete graph