Large set of P3‐decompositions

DOI10.1002/jcd.10008zbMath1004.05046OpenAlexW2025228344MaRDI QIDQ4537562

Yanfang Zhang, Qing-de Kang

Publication date: 1 July 2002

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs ⋮ Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

Cites Work

• Resolvable balanced bipartite designs
• \(G\)-decomposition of \(K_n\), where G has four vertices or less

This page was built for publication: Large set of P₃‐decompositions