P₃-factorization of Cartesian product of complete graphs

zbMATH Open1251.05135MaRDI QIDQ2918403FDOQ2918403

Authors: V. Chitra, A. Muthusamy 

Publication date: 6 October 2012

Published in: Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

Recommendations

• P₃-factorization of triangulated Cartesian product of complete graphs
• \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
• \(P_3\)-factorization of complete multipartite graphs
• P\({}_ 3\)-factorization of complete multipartite graphs
• \(P_ 3\)-factorization of complete bipartite graphs
• \(P_4\)-factorization of Cartesian product of complete graphs
• \(P_{5}\)-factorization of Cartesian product of graphs
• scientific article; zbMATH DE number 1334641
• On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs
• Factorization of Cartesian products of hypergraphs

zbMATH Keywords

Hamilton cycle decompositionpath factorization

Mathematics Subject Classification ID

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

Cited In (9)

• P₃-factorization of triangulated Cartesian product of complete graphs
• Factorizations of the product of cycles
• Title not available (Why is that?)
• \(P_{3}\)-factorization of triangulated Cartesian product of complete graph of odd order
• Factoring the Cartesian product of a cubic graph and a triangle
• P\({}_ 3\)-factorization of complete multipartite graphs
• Title not available (Why is that?)
• \(P_{5}\)-factorization of Cartesian product of graphs
• \(P_4\)-factorization of Cartesian product of complete graphs

This page was built for publication: \(P_3\)-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 Q2918403)