Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions
DOI10.1002/jcd.21375zbMath1295.05086OpenAlexW1813799644MaRDI QIDQ5406986
Justin Z. Schroeder, Mark 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonorientable Hamilton cycle embeddings of complete tripartite graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- The orientable genus of some joins of complete graphs with large edgeless graphs
- The nonorientable genus of complete tripartite graphs
- Das Geschlecht des vollständigen dreifärbbaren Graphen
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- ON THE FALSITY OF EULER'S CONJECTURE ABOUT THE NON-EXISTENCE OF TWO ORTHOGONAL LATIN SQUARES OF ORDER 4t + 2
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Hamiltonian embeddings from triangulations
- Transversals in Latin Squares
- A generalization of transversals for Latin squares
This page was built for publication: Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions
