Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares

DOI10.1016/S0012-365X(96)00214-2zbMath0876.05015OpenAlexW1979944938MaRDI QIDQ1356443

Anthony J. W. Hilton, Lars Døvling Andersen

Publication date: 9 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00214-2

zbMATH Keywords

embeddingtripartite graphtriangle partitionorthogonal latin squarespartial latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Hamiltonian decompositions of complete regular s-partite graphs ⋮ Amalgamations of factorizations of complete graphs ⋮ Hamiltonian decompositions of complete graphs

Cites Work

• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• The complexity of completing partial Latin squares
• Existence of orthogonal Latin squares with aligned subsquares
• The NP-Completeness of Edge-Coloring

This page was built for publication: Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares