Publication:3526001
From MaRDI portal
zbMath1157.68403MaRDI QIDQ3526001
C. A. Rodger, Charles C. Lindner
Publication date: 24 September 2008
68R01: General topics of discrete mathematics in relation to computer science
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Group divisible designs with block size five from Clatworthy's table, Unnamed Item, Unnamed Item, Multidecompositions of line graphs of complete graphs, Unnamed Item, Determination of the size of defining set for Steiner triple systems, Unnamed Item, Decompositions of some regular graphs into unicyclic graphs of order five, The 3-way flower intersection problem for Steiner triple systems, Decomposition of complete tripartite graphs into cycles and paths of length three, Unnamed Item, Unnamed Item, Two unfortunate properties of pure $f$-vectors, Decomposition of product graphs into paths and cycles of length four, A note on $GDD(1, n, n , 4;\lambda_{1},\lambda_{2})$, Unnamed Item, 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, Primitive cycle decompositions of Kn and Kn−I, Generalized packing designs, A natural generalization of orthogonality of Latin squares, Twofold triple systems without 2-intersecting Gray codes, Almost resolvable maximum packings of complete graphs with 4-cycles, 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
