Embedding path designs in 4-cycle systems

DOI10.1016/S0012-365X(01)00410-1zbMath1007.05035OpenAlexW2090479423MaRDI QIDQ1849905

Gaetano Quattrocchi

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00410-1

zbMATH Keywords

decompositioncycleembeddingpathgraph design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Minimum embedding of balanced \(P_{4}\)-designs into 5-cycle systems. ⋮ Sampling complete designs ⋮ Lower bounds for two-period grooming via linear programming duality ⋮ Grooming for two-period optical networks ⋮ Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs ⋮ Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\) ⋮ On some colouring of 4-cycle systems with specified block colour patterns ⋮ Maximum embedding of aE₂(v − w, 4, 1) into aP(v, 4,λ) ⋮ Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I ⋮ Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \) ⋮ Embeddings of \(P_{3}\)-designs into bowtie and almost bowtie systems ⋮ Embedding path designs into kite systems

This page was built for publication: Embedding path designs in 4-cycle systems