Pages that link to "Item:Q3337512"
From MaRDI portal
The following pages link to Isomorphism of graphs which are pairwise k-separable (Q3337512):
Displaying 7 items.
- Graphs of separability at most 2 (Q415268) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Testing isomorphism of circulant objects in polynomial time (Q2010626) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Isomorphism Testing Parameterized by Genus and Beyond (Q6188514) (← links)
- Testing isomorphism of circulant objects in polynomial time (Q6621250) (← links)