On Cartesian skeletons of graphs
From MaRDI portal
Recommendations
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- Factoring a graph in polynomial time
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- Fast recognition of direct and strong products
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
Cited in
(18)- A prime factor theorem for bipartite graphs
- Vertex-transitive direct products of graphs
- Asymmetric colorings of products of graphs and digraphs
- Prime factorization and domination in the hierarchical product of graphs
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- The Cartesian product of graphs with loops
- Edge-transitive products
- Digraphs products
- The pre-hull number and lexicographic product
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- A local prime factor decomposition algorithm
- scientific article; zbMATH DE number 969975 (Why is no real title available?)
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Distance formula for direct-co-direct product in the case of disconnected factors
- On some metric properties of direct-co-direct product
- On idomatic partitions of direct products of complete graphs
- On distance and strong metric dimension of the modular product
- Unitary Cayley graphs of finite semisimple rings
This page was built for publication: On Cartesian skeletons of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552332)
