Heffter arrays and biembedding graphs on surfaces
From MaRDI portal
Publication:2341067
zbMath1310.05142arXiv1412.0949MaRDI QIDQ2341067
Publication date: 22 April 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0949
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (29)
Non-zero sum Heffter arrays and their applications ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ On sequences in cyclic groups with distinct partial sums ⋮ Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays ⋮ Square integer Heffter arrays with empty cells ⋮ Tight Heffter Arrays Exist for all Possible Values ⋮ Rectangular Heffter arrays: a reduction theorem ⋮ Magic partially filled arrays on abelian groups ⋮ A problem on partial sums in 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 ⋮ Weak sequenceability in cyclic groups ⋮ Orthogonal cycle systems with cycle length less than 10 ⋮ Some new results about a conjecture by Brian Alspach ⋮ Settling the genus of the \(n\)-prism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Existence of some signed magic arrays ⋮ 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 \) ⋮ Globally simple Heffter arrays and orthogonal cyclic cycle decompositions ⋮ Relative Heffter arrays and biembeddings ⋮ Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic biembeddings of twofold triple systems
- Square integer Heffter arrays with empty cells
- Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
- Characterization of the maximum genus of a signed graph
- The topological theory of current graphs
- How to determine the maximum genus of a graph
- Bounds of the number of disjoint spanning trees
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Nonorientable biembeddings of Steiner triple systems
- Directed paths of diagonals within polygons
- Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph
- On Partial Sums in Cyclic Groups
- Tight Heffter Arrays Exist for all Possible Values
This page was built for publication: Heffter arrays and biembedding graphs on surfaces
