Tight globally simple nonzero sum Heffter arrays and biembeddings

DOI10.1002/jcd.21866zbMath1529.05030arXiv2205.10164OpenAlexW4309349696MaRDI QIDQ6187000

Lorenzo Mella, Anita Pasotti

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/2205.10164

zbMATH Keywords

complete multipartite graphbiembeddingHeffter arrayorthogonal cyclic path decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38)

Related Items (1)

Constructing generalized Heffter arrays via near alternating sign matrices

Cites Work

• Unnamed Item
• Square integer Heffter arrays with empty cells
• On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
• Non-zero sum Heffter arrays and their applications
• On sequences in cyclic groups with distinct partial sums
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Heffter arrays and biembedding graphs on surfaces
• Combinatorial Local Planarity and the Width of Graph Embeddings
• 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 with empty cells
• A tour problem on a toroidal board
• The existence of square non-integer Heffter arrays

This page was built for publication: Tight globally simple nonzero sum Heffter arrays and biembeddings