Pages that link to "Item:Q579285"
From MaRDI portal
The following pages link to Factoring a graph in polynomial time (Q579285):
Displayed 16 items.
- 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)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← 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)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- (Q2777507) (← links)
- Product graph representations (Q4020705) (← links)
- Factoring cartesian‐product graphs (Q4309984) (← links)