Pages that link to "Item:Q1067411"
From MaRDI portal
The following pages link to A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411):
Displaying 37 items.
- Recognizing some complementary products (Q389934) (← links)
- Unique square property, equitable partitions, and product-like graphs (Q394372) (← links)
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- Arithmetic for rooted trees (Q519885) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Approximate graph products (Q1024311) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Strong products of Kneser graphs (Q1336712) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Cartesian products of directed graphs with loops (Q1709534) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071) (← links)
- The grid property and product-like hypergraphs (Q2345539) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- An algorithm for<i>K</i>-convex closure and an application (Q2752262) (← links)
- (Q2777507) (← links)
- On Some Graph Operations and Related Applications (Q2839255) (← links)
- Factoring cartesian‐product graphs (Q4309984) (← links)
- On Cartesian products of signed graphs (Q5896107) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Recognizing graph products and bundles (Q6560201) (← links)
- The complement of the Djoković-Winkler relation (Q6658058) (← links)
