Symmetric 1-factorizations of the complete graph
From MaRDI portal
Publication:976163
DOI10.1016/J.EJC.2009.12.003zbMath1218.05145OpenAlexW2022053216WikidataQ114184868 ScholiaQ114184868MaRDI QIDQ976163
Anita Pasotti, Marco Antonio Pellegrini
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.12.003
Related Items (10)
One-factorisations of complete graphs arising from ovals in finite planes ⋮ On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k\)-matching] ⋮ Unnamed Item ⋮ Vertex‐regular 1‐factorizations in infinite graphs ⋮ Quaternionic 1-factorizations and complete sets of rainbow spanning trees ⋮ Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Abelian 1-factorizations in infinite graphs ⋮ On circular--linear one-factorizations of the complete graph
Uses Software
Cites Work
- Cyclic one-factorization of the complete graph
- Frattini-based starters in 2-groups
- Quaternionic starters
- One-factorizations of complete graphs with vertex-regular automorphism groups
- One-factorizations of the complete graph—A survey
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Symmetric 1-factorizations of the complete graph