P₃-factorization of Cartesian product of complete graphs
From MaRDI portal
Publication:2918403
Recommendations
- P3-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
Cited in
(9)- P\({}_ 3\)-factorization of complete multipartite graphs
- P3-factorization of triangulated Cartesian product of complete graphs
- scientific article; zbMATH DE number 4008445 (Why is no real title available?)
- \(P_4\)-factorization of Cartesian product of complete graphs
- \(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_{5}\)-factorization of Cartesian product of graphs
- Factorizations of the product of cycles
- scientific article; zbMATH DE number 4055660 (Why is no real title available?)
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)