On embedding incomplete symmetric Latin squares

Cites work

A Combinatorial Theorem with an Application to Latin Rectangles
Embedding an incomplete diagonal latin square in a complete diagonal latin square
Embedding Incomplete Latin Squares
Finite embedding theorems for partial Latin squares, quasi-groups, and loops
Systems of Distinct Representatives

Cited in

(40)

Completing incomplete commutative Latin squares with prescribed diagonals
Steiner quadruple systems having a prescribed number of quadruples in common
Intersection problem of Steiner systems S(3,4,2v)
Generalized latin rectangles. II: Embedding
Outline symmetric Latin squares
On the number of 1-factorizations of the complete graph
A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
A number-theoretic function related to Latin squares
Strong finite embeddability for classes of quasigroups
On the number of conjugates of a quasigroup
Intersection preserving finite embedding theorems for partial quasigroups
Edge domination in complete partite graphs
Hamiltonian double Latin squares
Existence of generalized Latin squares which are not embeddable in any group
On regular set systems containing regular subsystems
Recoloring subgraphs of \(K_{2n}\) for sports scheduling
Embedding connected factorizations
On completing partial Latin squares with prescribed diagonals
Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
Small embeddings for partial cycle systems of odd length
Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
The tournament scheduling problem with absences
Almost regular edge colorings and regular decompositions of complete graphs
Coloring Block Designs is NP-Complete
Coloring Steiner Triple Systems
Amalgamated Factorizations of Complete Graphs
On the completion of latin rectangles to symmetric latin squares
The finite embeddability property for IP loops and local embeddability of groups into finite IP loops
The fine structures of three symmetric Latin squares with even orders
Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
Toward a three-dimensional counterpart of Cruse's theorem
Ryser's theorem for symmetric -Latin squares
A partial m=(2k+1)-cycle system of order n can be embedded in an m- cycle of order (2n+1)m
Ryser's theorem for simple multi-Latin rectangles
Commuting pairs in quasigroups
Embedding connected factorizations. II
Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
Embedding partial Steiner triple systems is NP-complete
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
Embedding an incomplete latin square in a latin square with a prescribed diagonal

This page was built for publication: On embedding incomplete symmetric Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264673)