Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions
DOI10.1002/JCD.21375zbMATH Open1295.05086OpenAlexW1813799644MaRDI QIDQ5406986FDOQ5406986
Authors: Justin Z. Schroeder, M. N. Ellingham 
Publication date: 4 April 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21375
Recommendations
- Triangulations of orientable surfaces by complete tripartite graphs
- Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- On biembeddings of Latin squares
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Orthogonal arrays, Latin squares, Room squares (05B15) Generalized Ramsey theory (05C55)
Cites Work
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- The nonorientable genus of complete tripartite graphs
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- The orientable genus of some joins of complete graphs with large edgeless graphs
- Hamiltonian embeddings from triangulations
- A generalization of transversals for Latin squares
- Das Geschlecht des vollständigen dreifärbbaren Graphen
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs
- ON THE FALSITY OF EULER'S CONJECTURE ABOUT THE NON-EXISTENCE OF TWO ORTHOGONAL LATIN SQUARES OF ORDER 4t + 2
- Transversals in Latin Squares
- Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Hamiltonian embeddings from triangulations
- Triangulations of orientable surfaces by complete tripartite graphs
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
- Hamilton surfaces for the complete symmetric tripartite graph
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs
- Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
- Determination of regular embeddings of graphs on surfaces
This page was built for publication: Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406986)
