Design theory.
From MaRDI portal
Recommendations
Cited in
(52)- Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles
- Pairwise balanced design of order 6n+4 and 2-fold system of order 3n+2
- Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
- Decomposition of complete equipartite graphs into paths and cycles of length 2p
- Decompositions of line graphs of complete graphs into paths and cycles
- Embedding partial Latin squares in Latin squares with many mutually orthogonal mates
- Zero-sum flows for Steiner systems
- PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes
- Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
- New partitionings of complete designs
- Gregarious kite factorization of tensor product of complete graphs
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity
- A polynomial embedding of pairs of orthogonal partial Latin squares
- Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\)
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
- On decomposing the complete graph into the union of two disjoint cycles
- scientific article; zbMATH DE number 4152384 (Why is no real title available?)
- Generalized packing designs
- scientific article; zbMATH DE number 124513 (Why is no real title available?)
- scientific article; zbMATH DE number 1096962 (Why is no real title available?)
- Group divisible designs with block size five from Clatworthy's table
- A natural generalization of orthogonality of Latin squares
- Multidecompositions of line graphs of complete graphs
- Decompositions of some classes of regular graphs and digraphs into cycles of length 4p
- Determination of the size of defining set for Steiner triple systems
- Maximum packing and minimum covering of the line graph of the complete graph with kite
- The 3-way flower intersection problem for Steiner triple systems
- Decompositions of complete equipartite graphs into cycles of lengths 3 and 6
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Decompositions of some regular graphs into unicyclic graphs of order five
- Twofold triple systems without 2-intersecting Gray codes
- Group divisible designs of four groups and block size five with configuration (1, 1, 1, 2)
- p^2-cycle decompositions of the tensor product of complete graphs
- Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
- Two unfortunate properties of pure $f$-vectors
- A note on $GDD(1, n, n , 4;\lambda_{1},\lambda_{2})$
- Decomposition of product graphs into paths and cycles of length four
- Clique immersion in graph products
- Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Primitive cycle decompositions of Kn and Kn−I
- A recursive construction of doubly resolvable Steiner quadruple systems
- Decomposition of complete Tripartite graphs into triangles and claws
- Almost resolvable maximum packings of complete graphs with 4-cycles
- A note on clique immersion of strong product graphs
- Homogeneous mixed bowtie systems
- Weak colourings of Kirkman triple systems
- Super sudoku squares
- Existence of multi-Latin squares satisfying a persistent Sudoku condition
This page was built for publication: Design theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526001)
