Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
From MaRDI portal
Publication:2305901
DOI10.1016/j.disc.2019.111787zbMath1435.05040arXiv1906.07366OpenAlexW2999291433MaRDI QIDQ2305901
Emine Şule Yazıcı, Nicholas J. Cavenagh, Kevin Burrage, Diane M. Donovan
Publication date: 20 March 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.07366
globally simple Heffter arraysHeffter arraysHeffter difference problemorthogonal cycle decompositions
Related Items
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, 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, Unnamed Item, On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces, Relative Heffter arrays and biembeddings, Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Doubly even orientable closed 2-cell embeddings of the complete graph
- Square integer Heffter arrays with empty cells
- A problem on partial sums in abelian groups
- Orthogonal decomposition and packing of complete graphs
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Heffter arrays and biembedding graphs on surfaces
- Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph
- ON THE PROBLEM OF JACOBSTHAL
- 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
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- A tour problem on a toroidal board
- The existence of square non-integer Heffter arrays
- Tight Heffter Arrays Exist for all Possible Values
- Biembeddings of symmetric \(n\)-cycle systems
