On the graph isomorphism problem

We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems.

[1]  Jacobo Torán,et al.  The graph isomorphism problem , 2020, Commun. ACM.

[2]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[3]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[4]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[5]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[8]  Daniel A. Spielman,et al.  Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.

[9]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[10]  Hans L. Bodlaender,et al.  Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees , 1988, J. Algorithms.

[11]  Gary L. Miller,et al.  Isomorphism testing for graphs of bounded genus , 1980, STOC '80.

[12]  László Babai,et al.  Moderately Exponential Bound for Graph Isomorphism , 1981, FCT.

[13]  Shmuel Onn,et al.  Geometry, Complexity, and Combinatorics of Permutation Polytopes , 1993, J. Comb. Theory A.

[14]  I. S. Filotti,et al.  A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus , 1980, STOC '80.