Pages that link to "Item:Q3738557"
From MaRDI portal
The following pages link to Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism (Q3738557):
Displaying 6 items.
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Equipartitions of graphs (Q1182860) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- (Q2777507) (← links)
- Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product (Q4997214) (← links)
