Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
From MaRDI portal
Publication:5000298
zbMATH Open1468.05237MaRDI QIDQ5000298FDOQ5000298
Authors: Gloria Rinaldi 
Publication date: 12 July 2021
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p178.pdf
Recommendations
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees
- Symmetric 1-factorizations of the complete graph
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Abelian 1-factorizations of the complete graph
- Cyclic and dihedral 1-factorizations of multipartite graphs
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Endliche Gruppen I
- Title not available (Why is that?)
- Edge-disjoint rainbow spanning trees in complete graphs
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Cyclic one-factorization of the complete graph
- Frattini-based starters in 2-groups
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
- Nilpotent 1-factorizations of the complete graph
- Abelian 1-factorizations of the complete graph
- Symmetric 1-factorizations of the complete graph
- Title not available (Why is that?)
- One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
- Quaternionic starters
- Spanning trees orthogonal to one-factorizations of \(K_{2n}\).
- Multicolored isomorphic spanning trees in complete graphs.
- Title not available (Why is that?)
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Decompositions into spanning rainbow structures
- Starters: doubling constructions
- Rainbow spanning trees in properly coloured complete graphs
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
- Decompositions into isomorphic rainbow spanning trees
Cited In (5)
This page was built for publication: Regular \(1\)-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000298)
