Pages that link to "Item:Q1949105"
From MaRDI portal
The following pages link to On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105):
Displaying 6 items.
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- On subgraphs of Cartesian product graphs (Q1349090) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Global rigidity of (quasi-)injective frameworks on the line (Q2666584) (← links)
- On subgraphs of Cartesian product graphs and S-primeness (Q2816063) (← links)