Orthogonal cycle systems with cycle length less than 10
From MaRDI portal
Publication:6187010
DOI10.1002/jcd.21921zbMath1529.05092arXiv2302.05231OpenAlexW4387013569MaRDI QIDQ6187010
No author found.
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.05231
Paths and cycles (05C38) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On large sets of disjoint Steiner triple systems. IV
- Square integer Heffter arrays with empty cells
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- A new class of group divisible designs with block size three
- Some recent developments on BIBDs and related designs
- A problem on partial sums in abelian groups
- Orthogonal decomposition and packing of complete graphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
- Non-zero sum Heffter arrays and their applications
- On the existence of integer relative Heffter arrays
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Heffter arrays and biembedding graphs on surfaces
- Rectangular Heffter arrays: a reduction theorem
- Cycle decompositions III: Complete graphs and fixed length cycles
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces
- The existence of square integer Heffter arrays
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Relative Heffter arrays and biembeddings
- Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays
- The existence of square non-integer Heffter arrays
- Tight Heffter Arrays Exist for all Possible Values
- Mutually orthogonal cycle systems
