Decomposition of graphs into trees of order five

DOI10.61091/JCMCC130-20MaRDI QIDQ7250317zbMATH OpenFDO

Authors Hemalatha P., Chaadhanaa A.

Publication date 20 May 2026

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC130-20

zbMATH Keywords

\(Y\)-treescomplete bipartite graphscomplete graphsdecompositionpathsstars

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of complete graphs into arbitrary trees
• Decomposition of complete graphs into paths and stars with different number of edges
• Decomposition of complete graphs into stars
• Decomposition of product graphs into paths and stars on five vertices
• Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
• Multi-decomposition of graphs into paths and Y-trees of order five
• Multidecomposition of hypercube graphs into paths, cycles and stars
• Multidesigns for graph-pairs of order 4 and 5
• On claw-decomposition of complete graphs and complete bigraphs

This page was built for publication: Decomposition of graphs into trees of order five

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