P₃-factorization of triangulated Cartesian product of complete graph of odd order

DOI10.1007/978-3-319-64419-6_54MaRDI QIDQ1683589zbMATH OpenOpenAlexFDO

Authors A. Tamil Elakkiya, A. Muthusamy

Publication date 1 December 2017

Full work available at URL https://doi.org/10.1007/978-3-319-64419-6_54

zbMATH Keywords

Cartesian productpath factorizationtriangulated Cartesian product

Mathematics Subject Classification ID

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

Recommendations

• P₃-factorization of triangulated Cartesian product of complete graphs
• \(P_3\)-factorization of Cartesian product of complete graphs
• \(P_3\)-factorization of complete multipartite graphs
• P\({}_ 3\)-factorization of complete multipartite graphs
• \(P_ 3\)-factorization of complete bipartite graphs
• scientific article; zbMATH DE number 1334641
• Factoring the Cartesian product of a cubic graph and a triangle
• P₄-factorization of Cartesian product of complete graphs
• scientific article; zbMATH DE number 5027031
• On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs

Cited in

(4)

• Gregarious kite factorization of tensor product of complete graphs
• \(P_{5}\)-factorization of Cartesian product of graphs
• \(P_3\)-factorization of Cartesian product of complete graphs
• P₃-factorization of triangulated Cartesian product of complete graphs

This page was built for publication: \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order

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