The following pages link to (Q5590666):
Displaying 17 items.
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- A local prime factor decomposition algorithm (Q536219) (← links)
- Counterexamples to two conjectures about distance sequences (Q580361) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Retracts of strong products of graphs (Q686295) (← links)
- Weak reconstruction of strong product graphs (Q864154) (← links)
- Approximate graph products (Q1024311) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- The connectivities of locally finite primitive graphs (Q1812750) (← links)
- Connectivity of strong products of graphs (Q1959713) (← links)
- A method for obtaining refinement theorems, with an application to direct products of semigroups (Q2264784) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Cancellation properties of products of graphs (Q2457017) (← links)
- Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems) (Q2550037) (← links)
- (Q2777507) (← links)
- A bibliography of graph equations (Q3856811) (← links)
- (Q5708552) (← links)
