Automatic Proof of Graph Nonisomorphism

We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs. Mathematics Subject Classification (2000). 05C60, 68R10, 05C25, 03B35. Keywords. Graphs, groups, graph isomorphism, automatic proof generation.

• Type: Journal
• Year: 2008
• Where: MICS
• Authors: Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murray
• Keywords: Automatic Proof Generation, Mathematics Subject Classification, MICS 2008, Nonisomorphism Proofs