Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions

DOI10.1002/JCD.21375MaRDI QIDQ5406986zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

triangulationHamiltonian cyclegraph embeddingorthogonal Latin squarescomplete tripartite graphs

Mathematics Subject Classification ID

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)

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

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 4152399 (Why is no real title available?)
• scientific article; zbMATH DE number 398950 (Why is no real title available?)
• A generalization of transversals for Latin squares
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
• Das Geschlecht des vollständigen dreifärbbaren Graphen
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Hamiltonian embeddings from triangulations
• 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
• 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
• Transversals in Latin Squares

Cited in

(8)

• Nonorientable Hamilton cycle embeddings of complete tripartite graphs
• Orientable Hamilton cycle embeddings of complete tripartite graphs. II: Voltage graph constructions and applications
• A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
• Determination of regular embeddings of graphs on surfaces
• A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
• Triangulations of orientable surfaces by complete tripartite graphs
• Hamilton surfaces for the complete symmetric tripartite graph
• Hamiltonian embeddings from triangulations

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)