An existence theory for loopy graph decompositions

DOI10.1002/JCD.20280zbMath1223.05227OpenAlexW2159652182MaRDI QIDQ3087610

Peter J. Dukes, Amanda Malloch

Publication date: 16 August 2011

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20280

zbMATH Keywords

graph decompositiongroomingequireplicatePBD closure

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Balancing permuted copies of multigraphs and integer matrices ⋮ The Asymptotic Existence of Resolvable Group Divisible Designs ⋮ Resolvable group divisible designs with large groups ⋮ Local balance in graph decompositions

Cites Work

• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Decompositions of edge-colored complete graphs
• Asymptotic Existence of Resolvable Graph Designs

This page was built for publication: An existence theory for loopy graph decompositions