Two classes of large sets of graph factors of complete tripartite graphs

DOI10.11845/SXJZ.2015085BMaRDI QIDQ5367662zbMATH OpenOpenAlexFDO

Authors Guohui Hao

Publication date 20 October 2017

Full work available at URL http://www.oaj.pku.edu.cn/sxjz/EN/abstract/abstract71254.shtml

zbMATH Keywords

large setcomplete tripartite graph\({{K_{1,3}}}\)-factor\({{K_{2,2}}}\)-factor

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A class of large sets of \(K_{1,3}\)-factors of complete tripartite graphs
• Large sets of \(\lambda \)-fold \(K_{1,3}\)-factors of complete bipartite graphs.
• Large sets of \(\lambda \)-fold \(P_3\)-factors in \(K_{V,V}\).
• scientific article; zbMATH DE number 6605168
• scientific article; zbMATH DE number 6531837

Cited in

(5)

• Large sets of \(\lambda \)-fold \(P_3\)-factors in \(K_{V,V}\).
• scientific article; zbMATH DE number 6605168 (Why is no real title available?)
• A class of large sets of \(K_{1,3}\)-factors of complete tripartite graphs
• The isomorphic factorization of complete tripartite graphsK(m, n, s) into 9 × 2^kisomorphic factors
• Large sets of \(\lambda \)-fold \(K_{1,3}\)-factors of complete bipartite graphs.

This page was built for publication: Two classes of large sets of graph factors of complete tripartite graphs

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