P₅-factorization of Cartesian product of graphs

DOI10.1142/S1793830914500190zbMATH Open1370.05168OpenAlexW2126720817MaRDI QIDQ2875684FDOQ2875684

Authors: A. Tamil Elakkiya, A. Muthusamy 

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500190

Recommendations

• \(P_3\)-factorization of Cartesian product of complete graphs
• \(P_4\)-factorization of Cartesian product of complete graphs
• \(P_{5}\)-factorization of complete bipartite graphs
• \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
• Publication:4733888

zbMATH Keywords

Cartesian product of graphspath factorization

Mathematics Subject Classification ID

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

Cited In (5)

• P₃-factorization of triangulated Cartesian product of complete graphs
• Factorizations of the product of cycles
• Q₅‐factorization of λK_n
• \(P_4\)-factorization of Cartesian product of complete graphs
• \(P_3\)-factorization of Cartesian product of complete graphs

This page was built for publication: \(P_{5}\)-factorization of Cartesian product of graphs

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