P3-factorization of triangulated Cartesian product of complete graphs

DOI10.1142/S1793830914500669zbMath1314.05160OpenAlexW1980418669MaRDI QIDQ5245849

A. Tamil Elakkiya, Appu Muthusamy

Publication date: 15 April 2015

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

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

zbMATH Keywords

Cartesian productspath factorizationtriangulated Cartesian products

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Gregarious kite factorization of tensor product of complete graphs

Cites Work

• Unnamed Item
• Recognizing triangulated Cartesian graph products
• The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
• P\({}_ 3\)-factorization of complete multipartite graphs
• \(P_ 3\)-factorization of complete bipartite graphs
• Path factorizations of complete multipartite graphs
• On path factorizations of complete multipartite graphs
• \(P_{5}\)-factorization of complete bipartite graphs
• P₅-FACTORIZATION OF CARTESIAN PRODUCT OF GRAPHS

This page was built for publication: P₃-factorization of triangulated Cartesian product of complete graphs