Large sets of -fold K₁,3-factors of complete bipartite graphs.

zbMATH Open1289.05373MaRDI QIDQ2864474FDOQ2864474

Authors: Guohui Hao, Qingde Kang 

Publication date: 6 December 2013

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (6)

• Large sets of \(\lambda \)-fold \(P_3\)-factors in \(K_{V,V}\).
• Two classes of large sets of graph factors of complete tripartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of large sets of \(K_{1,3}\)-factors of complete tripartite graphs
• Large sets of \(K_{3,3}\)-decomposition of complete bipartite graphs

This page was built for publication: Large sets of \(\lambda \)-fold \(K_{1,3}\)-factors of complete bipartite graphs.

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