Recommendations
Cited in
(48)- Embedding partial Mendelsohn triple systems
- Hamiltonian double Latin squares
- Completing partial Latin squares with two cyclically generated prescribed diagonals
- Completing partial Latin squares with prescribed diagonals.
- Completing some partial Latin squares
- Some results on generalized Latin squares
- Avoiding and extending partial edge colorings of hypercubes
- The \(n\)-queens completion problem
- Restricted extension of sparse partial edge colorings of hypercubes
- Completion and deficiency problems
- Maximal partial Latin cubes
- Clique decompositions of multipartite graphs and completion of Latin squares
- Covers and partial transversals of Latin squares
- Restricted extension of sparse partial edge colorings of complete graphs
- Restricted edge-colourings of bipartite graphs
- Completing partial Latin squares with one nonempty row, column, and symbol
- scientific article; zbMATH DE number 6383870 (Why is no real title available?)
- Decomposition of bicolored square arrays into bichromatic diagonals
- Decomposition of bi-colored square arrays into balanced diagonals
- On Smetaniuk's Construction for Latin Squares and the Andersen-Hilton Theorem
- scientific article; zbMATH DE number 16253 (Why is no real title available?)
- On the intricacy of avoiding multiple-entry arrays
- Symmetric latin square and complete graph analogues of the evans conjecture
- An Evans-style result for block designs
- Edge precoloring extension of trees
- Development of one approach to constructing a set of block bijective transformations
- One approach to constructing a transitive class of block transformations
- Refinements of Hall's condition
- Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
- scientific article; zbMATH DE number 7535772 (Why is no real title available?)
- On completing latin squares
- Completing partial Latin squares with blocks of non-empty cells
- A generalization of interval edge-colorings of graphs
- Extending partial edge colorings of iterated Cartesian products of cycles and paths
- Completing multi-Latin rectangles via factors with prescribed degrees in bipartite graphs
- Completing partial k-star designs
- A new class of premature, partial Latin squares
- Extending partial edge colorings of Cartesian products of graphs
- Edge precoloring extension of trees. II
- Embedding connected factorizations. II
- Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
- On avoiding some families of arrays
- Extending Latin rectangles with restraints
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
- On the intricacy of combinatorial construction problems
- On avoiding odd partial Latin squares and r-multi Latin squares
- On a generalization of the Evans Conjecture
- On the completability of incomplete Latin squares
This page was built for publication: Thank Evans!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222202)
