3 research outputs found
Automatic proof of graph nonisomorphism
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machine-readable. We have developed an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs
AUTOMATIC PROOF OF GRAPH NONISOMORPHISM
Abstract. 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. 1