scientific article
From MaRDI portal
Publication:3924220
zbMath0471.05013MaRDI QIDQ3924220
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
Avoiding and extending partial edge colorings of hypercubes ⋮ Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Completing partial Latin squares with one nonempty row, column, and symbol ⋮ Decomposition of bi-colored square arrays into balanced diagonals ⋮ The \(n\)-queens completion problem ⋮ On avoiding odd partial Latin squares and \(r\)-multi Latin squares ⋮ Развитие одного подхода к построению множества блочных биективных преобразований ⋮ Partial triple systems and edge colourings ⋮ Extension from precoloured sets of edges ⋮ Restricted extension of sparse partial edge colorings of complete graphs ⋮ A generalization of interval edge-colorings of graphs ⋮ Combinatorial methods in the construction of point sets with uniformity properties ⋮ Covers and partial transversals of Latin squares ⋮ Unnamed Item ⋮ Constrained completion of partial Latin squares ⋮ Decomposition of Bicolored Square Arrays into Bichromatic Diagonals ⋮ Latin squares from multiplication tables ⋮ Restricted extension of sparse partial edge colorings of hypercubes ⋮ Completing partial Latin squares with two cyclically generated prescribed diagonals ⋮ Completion and deficiency problems ⋮ Some partial Latin cubes and their completions ⋮ Unnamed Item ⋮ Completing partial Latin squares with prescribed diagonals. ⋮ On a generalization of the Evans Conjecture ⋮ ONE APPROACH TO CONSTRUCTING A TRANSITIVE CLASS OF BLOCK TRANSFORMATIONS ⋮ Unit-time scheduling problems with time dependent resources ⋮ Approximating latin square extensions ⋮ On the completability of incomplete Latin squares ⋮ The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs ⋮ Restricted Edge-colourings of Bipartite Graphs ⋮ On completing latin squares ⋮ Unnamed Item ⋮ Completing partial Latin squares with blocks of non-empty cells ⋮ The Latin squares and the secret sharing schemes ⋮ Restricted completion of sparse partial Latin squares ⋮ On avoiding some families of arrays ⋮ Tournaments and Semicomplete Digraphs ⋮ Completing some partial Latin squares ⋮ Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results ⋮ Maximal partial Latin cubes ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ On the intricacy of combinatorial construction problems ⋮ An Evans-Style Result for Block Designs
This page was built for publication:
