\(k\)-pyramidal one-factorizations
From MaRDI portal
Publication:995770
DOI10.1007/s00373-007-0734-zzbMath1123.05076OpenAlexW2052082494WikidataQ114229704 ScholiaQ114229704MaRDI QIDQ995770
Gloria Rinaldi, Giuseppe Mazzuoccolo
Publication date: 10 September 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0734-z
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations ⋮ Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic one-factorization of the complete graph
- Sequencings and starters
- \(R\)-sequenceability and \(R^*\)-sequenceability of Abelian 2-groups
- Frattini-based starters in 2-groups
- Quaternionic starters
- Sequenceable groups and related topics.
- One-factorizations of complete graphs with vertex-regular automorphism groups
- One-factorizations of the complete graph—A survey
- Minimal Edge-Colourings of Complete Graphs
- Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
- Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
- Nilpotent 1-factorizations of the complete graph
- Abelian 1-factorizations of the complete graph