Graph divisible designs and packing constructions

DOI10.1007/s00373-014-1518-xzbMath1327.05223OpenAlexW2133298523MaRDI QIDQ897275

Alan C. H. Ling, Peter J. Dukes

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1518-x

zbMATH Keywords

embeddingpackingdivisible designgraph factorization

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)

Related Items (2)

Leaves for packings with block size four ⋮ Matching divisible designs with block size four

Cites Work

• Unnamed Item
• Unnamed Item
• 1-factorizing regular graphs of high degree - an improved bound
• Group divisible designs with block-size four
• HGDDs with block size four.
• Modified group divisible designs with block size 5 and \(\lambda=1\)
• Steiner systems \(S(2,4,v)\) -- a survey
• Decompositions of edge-colored complete graphs
• An Existence Theory for Incomplete Designs
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
• The Asymptotic Existence of Resolvable Group Divisible Designs
• Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

This page was built for publication: Graph divisible designs and packing constructions