Thank Evans!
From MaRDI portal
Publication:3222202
DOI10.1112/PLMS/S3-47.3.507zbMATH Open0557.05013OpenAlexW4254230493MaRDI QIDQ3222202FDOQ3222202
Authors: Lars Døvling Andersen, A. J. W. Hilton 
Publication date: 1983
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-47.3.507
Recommendations
Cited In (41)
- The \(n\)-queens completion problem
- Embedding partial Mendelsohn triple systems
- Refinements of Hall's condition
- Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
- Completing partial Latin squares with prescribed diagonals.
- On avoiding odd partial Latin squares and \(r\)-multi Latin squares
- Completing partial Latin squares with one nonempty row, column, and symbol
- On a generalization of the Evans Conjecture
- Avoiding and extending partial edge colorings of hypercubes
- On the completability of incomplete Latin squares
- Decomposition of bicolored square arrays into bichromatic diagonals
- Restricted extension of sparse partial edge colorings of hypercubes
- On completing latin squares
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
- Maximal partial Latin cubes
- One approach to constructing a transitive class of block transformations
- Development of one approach to constructing a set of block bijective transformations
- Restricted extension of sparse partial edge colorings of complete graphs
- Extending partial edge colorings of iterated Cartesian products of cycles and paths
- Title not available (Why is that?)
- A generalization of interval edge-colorings of graphs
- Completing partial Latin squares with blocks of non-empty cells
- On the intricacy of avoiding multiple-entry arrays
- Decomposition of bi-colored square arrays into balanced diagonals
- Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
- On avoiding some families of arrays
- On the intricacy of combinatorial construction problems
- Completion and deficiency problems
- Title not available (Why is that?)
- Clique decompositions of multipartite graphs and completion of Latin squares
- Covers and partial transversals of Latin squares
- Title not available (Why is that?)
- Completing partial Latin squares with two cyclically generated prescribed diagonals
- Restricted edge-colourings of bipartite graphs
- Some results on generalized Latin squares
- Extending Latin rectangles with restraints
- An Evans-style result for block designs
- Completing some partial Latin squares
- Edge precoloring extension of trees
- Hamiltonian double Latin squares
- On Smetaniuk's Construction for Latin Squares and the Andersen-Hilton Theorem
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)
