The following pages link to (Q4886098):
Displaying 5 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- On the power of combinatorial and spectral invariants (Q962126) (← links)
- On the Combinatorial Power of the Weisfeiler-Lehman Algorithm (Q5283372) (← links)
- Neighborhood hypergraphs of bipartite graphs (Q5387058) (← links)