Graph decompositions, handcuffed prisoners and balanced p-designs
From MaRDI portal
Publication:2556864
DOI10.1016/0012-365X(72)90005-2zbMath0251.05015MaRDI QIDQ2556864
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the chromatic index of path decompositions, Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs, Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges, Edge-coloured designs with block size four, On arcs in path designs of block size four, Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars, Tree-designs with balanced-type conditions, Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs, Edge balanced star‐hypergraph designs and vertex colorings of path designs, Difference systems, graph designs, and coloring problems, Unnamed Item, Edge partitions of the complete symmetric directed graph and related designs, Some problems about linear arboricity, Existence of resolvable path designs, On \(c\)-Bhaskar Rao designs and tight embeddings for path designs, Balanced and strongly balanced \(P_k\)-designs, Resolvable 3-star designs, Balanced directed cycle designs based on groups, Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs, On arcs in path designs of block size 3, Ovals in handcuffed designs of order \(v\) and block size 3, Packing paths in complete graphs, Handcuffed designs, Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.), Another class of balanced graph designs: Balanced circuit designs, On resolvable multipartite \(G\)-designs. II, Resolvable balanced bipartite designs, Balanced bipartite weighing designs, \(G\)-decomposition of \(K_n\), where G has four vertices or less, \(G\)-designs and related designs, On linear k-arboricity, Unnamed Item, Spanning cubic graph designs, Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs, Embedding path designs into kite systems, Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices, Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles, Resolvable path designs, Local balance in graph decompositions, Superpure digraph designs
Cites Work
