Globally simple Heffter arrays and orthogonal cyclic cycle decompositions

zbMath1405.05018arXiv1709.05812MaRDI QIDQ4622638

Marco Antonio Pellegrini, Fiorenza Morini, Simone Costa, Anita Pasotti

Publication date: 13 February 2019

Full work available at URL: https://arxiv.org/abs/1709.05812

zbMATH Keywords

complete graphcocktail party graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (20)

Non-zero sum Heffter arrays and their applications ⋮ Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays ⋮ Rectangular Heffter arrays: a reduction theorem ⋮ Magic partially filled arrays on abelian groups ⋮ Weak Heffter arrays and biembedding graphs on non-orientable surfaces ⋮ Constructing generalized Heffter arrays via near alternating sign matrices ⋮ On the existence of integer relative Heffter arrays ⋮ A generalization of Heffter arrays ⋮ Tight globally simple nonzero sum Heffter arrays and biembeddings ⋮ Orthogonal cycle systems with cycle length less than 10 ⋮ Some new results about a conjecture by Brian Alspach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A tour problem on a toroidal board ⋮ A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays ⋮ On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces ⋮ The existence of square non-integer Heffter arrays ⋮ Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) ⋮ Relative Heffter arrays and biembeddings ⋮ Mutually orthogonal cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of some signed magic arrays
• Square integer Heffter arrays with empty cells
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Latin squares. New developments in the theory and applications
• Orthogonal arrays. Theory and applications
• Skolem-type difference sets for cycle systems
• A problem on partial sums in abelian groups
• Orthogonal decomposition and packing of complete graphs
• On the existence of magic \(n\)-dimensional rectangles
• Magic rectangles revisited
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Heffter arrays and biembedding graphs on surfaces
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• On Partial Sums in Cyclic Groups
• Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
• Cyclic $m$-cycle systems of complete graphs minus a 1-factor
• Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces
• The existence of square integer Heffter arrays
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• The existence of square non-integer Heffter arrays
• Tight Heffter Arrays Exist for all Possible Values
• Orientable embedding of Cayley graphs

This page was built for publication: Globally simple Heffter arrays and orthogonal cyclic cycle decompositions