Balanced and strongly balanced \(P_k\)-designs

DOI10.1016/j.disc.2011.05.015zbMath1236.05019OpenAlexW2083798621MaRDI QIDQ658112

Mario Gionfriddo, Luigia Berardi, Rosaria Rota

Publication date: 11 January 2012

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

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

zbMATH Keywords

\(G\)-design\(G\)-decomposition of a complete graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph designs and isomorphic decomposition (05C51)

Related Items (7)

Tree-designs with balanced-type conditions ⋮ On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites ⋮ Edge balanced star‐hypergraph designs and vertex colorings of path designs ⋮ Intersections among Steiner systemsS(k,k+ 1,v) ⋮ Blocking sets inG-designs andK_3,3- designs ⋮ Unnamed Item ⋮ Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs
• Graph decompositions, handcuffed prisoners and balanced p-designs

This page was built for publication: Balanced and strongly balanced \(P_k\)-designs