Large sets of K₃,3-decomposition of complete bipartite graphs

MaRDI QIDQ4980476zbMATH OpenFDO

Authors Yanfang Zhang

Publication date 30 June 2014

zbMATH Keywords

\(K_{3,3}\)-decompositioncomplete bipartite graphlarge set

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 7108159
• Large sets of \(K_{2,2}\)-decomposition of complete bipartite graphs.
• Large sets of \(P_3\)-decompositions of complete multipartite graphs.
• On large sets of \(K_{1, p}\)-decomposition of complete bipartite graphs
• Large sets of \(\lambda \)-fold \(K_{1,3}\)-factors of complete bipartite graphs.

Cited in

(11)

• On large bipartite graphs of diameter 3
• Large sets of \(K_{2,2}\)-decomposition of complete bipartite graphs.
• Large set of P₃‐decompositions
• scientific article; zbMATH DE number 2094440 (Why is no real title available?)
• Large sets of \(P_3\)-decompositions of complete multipartite graphs.
• scientific article; zbMATH DE number 7108159 (Why is no real title available?)
• Large sets of oriented P₃-decompositions of directed complete bipartite graphs
• On large sets of \(K_{1, p}\)-decomposition of complete bipartite graphs
• On large sets ofPk-decompositions
• Large sets and overlarge sets of triangle-decomposition
• Finding large 3-free sets. I. The small \(n\) case

This page was built for publication: Large sets of \(K_{3,3}\)-decomposition of complete bipartite graphs

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