k-cycle free one-factorizations of complete graphs
From MaRDI portal
Publication:1010904
zbMATH Open1178.05077MaRDI QIDQ1010904FDOQ1010904
Authors: Mariusz Meszka 
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117289
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Cyclic one-factorization of the complete graph
- On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs
- Two orthogonal 4-cycle-free one-factorizations of complete graphs
- scientific article; zbMATH DE number 279572
- A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
Cited In (14)
- Optimal ternary constant-composition codes with weight four and distance three
- Title not available (Why is that?)
- Cyclic one-factorization of the complete graph
- On circular--linear one-factorizations of the complete graph
- On strong Skolem starters for \(\mathbb{Z}_{pq} \)
- A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs
- Switching in one-factorisations of complete graphs
- One-factorizations of the complete graph—A survey
- Title not available (Why is that?)
- Two orthogonal 4-cycle-free one-factorizations of complete graphs
- On the structure of uniform one-factorizations from starters in finite fields
- On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs
- Title not available (Why is that?)
- Unifying some known infinite families of combinatorial 3-designs
This page was built for publication: \(k\)-cycle free one-factorizations of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010904)
