Funder
Simons Foundation
National Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Distinguishing cartesian powers of graphs;Albertson;Electron. J. Combin.,2005
2. Symmetry breaking in graphs;Albertson;Electron. J. Combin.,1996
3. Combinatorial nullstellensatz, recent trends in combinatorics;Alon;Combin. Probab. Comput.,1999
4. On computing the distinguishing numbers of planar graphs and beyond: a counting approach;Arvind;SIAM J. Discrete Math.,2008
5. L. Babai, Graph isomorphism in quasipolynomial time, 89 pp. arXiv preprint arXiv:1512.03547 [cs.DS].