Tree-designs with balanced-type conditions

DOI10.1016/J.DISC.2011.12.020zbMath1277.05034OpenAlexW1977070299MaRDI QIDQ385383

Beatrice Ruini, Arrigo Bonisoli

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.020

zbMATH Keywords

\(G\)-designbalanced \(G\)-designgraph-decomposition

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Edge balanced star‐hypergraph designs and vertex colorings of path designs

Cites Work

• Balanced and strongly balanced \(P_k\)-designs
• On the existence of balanced bipartite designs. II
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices
• A survey on the existence ofG-Designs
• Decomposition of complete graphs into stars
• Handcuffed designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree-designs with balanced-type conditions