P₄-factorization of Cartesian product of complete graphs

MaRDI QIDQ2850072zbMATH OpenFDO

Authors R. Sampathkumar, P. Kandan

Publication date 26 September 2013

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

zbMATH Keywords

Cartesian product of graphspath factorization

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_3\)-factorization of Cartesian product of complete graphs
• \(P_{5}\)-factorization of Cartesian product of graphs
• \(P_{4k-1}\)-factorization of bipartite multigraphs
• \(P_{4k-1}\)-factorization of complete bipartite graphs
• scientific article; zbMATH DE number 1279033

Cited in

(7)

• \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
• Factorisations of 4-regular graphs and Petersen's theorem
• \(C_{4p}\)-frame of complete multipartite multigraphs
• Component factors of the Cartesian product of 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_4\)-factorization of Cartesian product of complete graphs

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