Automatic proof of graph nonisomorphism
Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murray
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machine-readable. We have developed a proof generator for graph nonisomorphism, which allows users to input graphs and construct a proof of (non)isomorphism.
This paper is available as a pdf (200kB) file.