Large set of P3‐decompositions

DOI10.1002/JCD.10008zbMATH Open1004.05046OpenAlexW2025228344MaRDI QIDQ4537562FDOQ4537562

Authors: Yanfang Zhang, Qingde 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

Recommendations

• Large sets of \(P_3\)-decompositions of complete multipartite graphs.
• scientific article; zbMATH DE number 6490101
• Large sets of oriented \(P_3\)-decompositions of directed complete bipartite graphs
• Large sets of \(K_{3,3}\)-decomposition of complete bipartite graphs
• The spectrum for overlarge sets of directed \(P_3\)-decompositions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
• The spectrum for overlarge sets of directed \(P_3\)-decompositions
• Title not available (Why is that?)
• On large sets ofPk-decompositions
• Large sets and overlarge sets of triangle-decomposition
• On large set and overlarge set of a triangle-decomposition
• Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs

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

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