Author:
Gurvich Vladimir,Zverovich Igor E.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. Reconstructing a graph from its neighborhood lists;Aigner;Combin. Probab. Comput.,1993
2. The star system problem is at least as hard as graph isomorphism problem;Babai,1978
3. Enumeration of bipartite self-complementary graphs;Bhave;Indian J. Pure Appl. Math.,1997
4. Neighborhood hypergraphs of bipartite graphs;Boros;J. Graph Theory,2008
5. Graph isomorphism and self-complementary graphs;Colbourn;S.I.G.A.C.T. News,1978