Pages that link to "Item:Q1210332"
From MaRDI portal
The following pages link to Cartesian graph factorization at logarithmic cost per edge (Q1210332):
Displayed 9 items.
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← 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)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)