Weak Heffter arrays and biembedding graphs on non-orientable surfaces
From MaRDI portal
Publication:6117411
DOI10.37236/11891arXiv2302.10617OpenAlexW4391263733WikidataQ129284520 ScholiaQ129284520MaRDI QIDQ6117411
Lorenzo Mella, Simone Costa, Anita Pasotti
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.10617
Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Square integer Heffter arrays with empty cells
- Heffter arrays and biembedding graphs on surfaces
- Rectangular Heffter arrays: a reduction theorem
- 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
- A tour problem on a toroidal board
- The existence of square non-integer Heffter arrays
- Tight Heffter Arrays Exist for all Possible Values
- A generalization of Heffter arrays
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Weak Heffter arrays and biembedding graphs on non-orientable surfaces