Automatic proof of graph nonisomorphism

A.M. Cohen, J.W. Knopper, S.H. Murray

Research output: Contribution to journalArticleAcademicpeer-review


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.
Original languageEnglish
Pages (from-to)211-229
JournalMathematics in Computer Science
Issue number2
Publication statusPublished - 2008


Dive into the research topics of 'Automatic proof of graph nonisomorphism'. Together they form a unique fingerprint.

Cite this