Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs

DOI10.1007/S00373-004-0582-ZzbMath1055.05022OpenAlexW2032410645MaRDI QIDQ704856

Gaetano Quattrocchi, Zsolt Tuza

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0582-z

zbMATH Keywords

EmbeddingCycle systemPath design

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30)

Related Items (1)

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

This page was built for publication: Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs