Regular 1-factorizations of complete graphs and decompositions into pairwise isomorphic rainbow spanning trees
From MaRDI portal
Publication:5000298
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
Cites work
- scientific article; zbMATH DE number 124525 (Why is no real title available?)
- scientific article; zbMATH DE number 3520420 (Why is no real title available?)
- scientific article; zbMATH DE number 3577438 (Why is no real title available?)
- scientific article; zbMATH DE number 1753164 (Why is no real title available?)
- Abelian 1-factorizations of the complete graph
- Cyclic one-factorization of the complete graph
- Decompositions into isomorphic rainbow spanning trees
- Decompositions into spanning rainbow structures
- Edge-disjoint rainbow spanning trees in complete graphs
- Endliche Gruppen I
- Frattini-based starters in 2-groups
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Multicolored isomorphic spanning trees in complete graphs.
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Nilpotent 1-factorizations of the complete graph
- One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
- One-factorizations of complete graphs with vertex-regular automorphism groups
- Quaternionic starters
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
- Rainbow spanning trees in complete graphs colored by one‐factorizations
- Rainbow spanning trees in properly coloured complete graphs
- Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
- Spanning trees orthogonal to one-factorizations of \(K_{2n}\).
- Starters: doubling constructions
- Symmetric 1-factorizations of the complete graph
Cited in
(5)- Rainbow spanning trees in complete graphs colored by one‐factorizations
- scientific article; zbMATH DE number 5054173 (Why is no real title available?)
- Decompositions into spanning rainbow structures
- Quaternionic 1-factorizations and complete sets of rainbow spanning trees
- Vertex-regular 1-factorizations of the complete graph
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)
