Graph divisible designs and packing constructions

DOI10.1007/S00373-014-1518-XMaRDI QIDQ897275zbMATH OpenOpenAlexFDO

Authors Alan C. H. Ling, Peter 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)

Recommendations

• Matching divisible designs with block size four
• scientific article; zbMATH DE number 2114468
• An application of modified group divisible designs
• Constructions of optimal packing and covering of the complete multigraph with applications
• Group divisible designs with two associate classes and \(\lambda_2=5\)

Cites work

• scientific article; zbMATH DE number 3487460 (Why is no real title available?)
• 1-factorizing regular graphs of high degree - an improved bound
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• An existence theory for incomplete designs
• Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Decompositions of edge-colored complete graphs
• Group divisible designs with block-size four
• HGDDs with block size four.
• Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
• Modified group divisible designs with block size 5 and =1
• Steiner systems \(S(2,4,v)\) -- a survey
• The CRC handbook of combinatorial designs
• The asymptotic existence of resolvable group divisible designs
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6

Cited in

(5)

• Divisible design digraphs and association schemes
• New constructions of divisible design Cayley graphs
• Divisible design Cayley digraphs
• Leaves for packings with block size four
• Matching divisible designs with block size four

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897275)