Exact embedding of two \(G\)-designs into a \((G+e)\)-design

DOI10.1016/j.disc.2011.03.010zbMath1238.05171OpenAlexW2216789684MaRDI QIDQ658086

Giorgio Ragusa, Gaetano Quattrocchi

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.03.010

zbMATH Keywords

cycle systemsBIBDcube systemspath designsstar designs

Mathematics Subject Classification ID

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

Related Items (1)

Minimum embedding of STSs into \((K_3+e)\)-systems

Cites Work

• Unnamed Item
• Unnamed Item
• Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs
• A theorem on flows in networks
• A survey on the existence ofG-Designs
• Grooming for two-period optical networks
• Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
• Colouring \(4\)-cycle systems with specified block colour patterns: The case of embedding \(P_3\)-designs

This page was built for publication: Exact embedding of two \(G\)-designs into a \((G+e)\)-design