A constraint on the biembedding of Latin squares
From MaRDI portal
Publication:1003587
DOI10.1016/J.EJC.2008.05.007zbMATH Open1170.05017OpenAlexW2014853538MaRDI QIDQ1003587FDOQ1003587
Authors: T. S. Griggs, James Lefevre, Diane Donovan, Michael John Grannell 
Publication date: 4 March 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.05.007
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Genus embeddings for some complete tripartite graphs
- Design and topology
- Biembeddings of Latin squares of side 8
- On the number of 8\(\times 8\) Latin squares
Cited In (15)
- On biembeddings of Latin squares
- MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
- Biembeddings of Abelian groups
- On parity vectors of Latin squares
- Embedding a latin square in a pair of orthogonal latin squares
- Quarter-regular biembeddings of Latin squares
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- Title not available (Why is that?)
- Biembeddings of Latin squares of side 8
- A construction for biembeddings of Latin squares
- There are asymptotically the same number of Latin squares of each parity
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- On biembedding an idempotent Latin square with its transpose
This page was built for publication: A constraint on the biembedding of Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003587)
