Decomposition of bipartite graphs into spiders all of whose legs are two in length.

zbMATH Open1313.05302MaRDI QIDQ2936670FDOQ2936670

Authors: Tay-Woei Shyu, Ying-Ren Chen, Chiang Lin, Ming-Hong Zhong 

Publication date: 6 January 2015

Recommendations

• scientific article; zbMATH DE number 2197904
• Minimum coverings of crowns with cycles and stars
• scientific article; zbMATH DE number 2191982
• Cycle decompositions of crowns
• Multidecompositions of complete bipartite graphs into cycles and stars

zbMATH Keywords

decompositionspidercomplete bipartite graphcrown

Mathematics Subject Classification ID

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

Cited In (2)

• Complete bipartite decompositions of crowns, with applications to complete directed graphs
• On graceful spider graphs with at most four legs of lengths greater than one

This page was built for publication: Decomposition of bipartite graphs into spiders all of whose legs are two in length.

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