On embedding incomplete symmetric Latin squares
From MaRDI portal
Publication:2264673
DOI10.1016/0097-3165(74)90068-5zbMath0274.05016OpenAlexW1995977838MaRDI QIDQ2264673
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(74)90068-5
Related Items
Coloring Block Designs is NP-Complete, Coloring Steiner Triple Systems, Edge domination in complete partite graphs, Embedding connected factorizations, Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations, Intersection problem of Steiner systems S(3,4,2v), The tournament scheduling problem with absences, Small embeddings for partial cycle systems of odd length, On the completion of latin rectangles to symmetric latin squares, On completing partial Latin squares with prescribed diagonals, Amalgamated Factorizations of Complete Graphs, Hamiltonian double Latin squares, Existence of generalized Latin squares which are not embeddable in any group, Generalized latin rectangles. II: Embedding, Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs, Outline symmetric Latin squares, On regular set systems containing regular subsystems, A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\), On the number of 1-factorizations of the complete graph, The fine structures of three symmetric Latin squares with even orders, 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, Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice, Intersection preserving finite embedding theorems for partial quasigroups, Recoloring subgraphs of \(K_{2n}\) for sports scheduling, Almost regular edge colorings and regular decompositions of complete graphs, The finite embeddability property for IP loops and local embeddability of groups into finite IP loops, Embedding partial Steiner triple systems is NP-complete, Completing incomplete commutative Latin squares with prescribed diagonals, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results, Embedding an incomplete latin square in a latin square with a prescribed diagonal, Steiner quadruple systems having a prescribed number of quadruples in common
Cites Work
