Automatic proof of graph nonisomorphism

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

doi:10.1007/s11786-008-0052-8

Automatic proof of graph nonisomorphism

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

Discrete Algebra and Geometry

Research output: Contribution to journal › Article › Academic › peer-review

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 an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs.

Original language	English
Pages (from-to)	211-229
Journal	Mathematics in Computer Science
Volume	2
Issue number	2
DOIs	https://doi.org/10.1007/s11786-008-0052-8
Publication status	Published - 2008

Access to Document

10.1007/s11786-008-0052-8

Cite this

@article{15d78389174b460eaf5ff90b662cb856,

title = "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 an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs.",

author = "A.M. Cohen and J.W. Knopper and S.H. Murray",

year = "2008",

doi = "10.1007/s11786-008-0052-8",

language = "English",

volume = "2",

pages = "211--229",

journal = "Mathematics in Computer Science",

issn = "1661-8270",

publisher = "Birkh{\"a}user Verlag",

number = "2",

}

TY - JOUR

T1 - Automatic proof of graph nonisomorphism

AU - Cohen, A.M.

AU - Knopper, J.W.

AU - Murray, S.H.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1007/s11786-008-0052-8

DO - 10.1007/s11786-008-0052-8

M3 - Article

SN - 1661-8270

VL - 2

SP - 211

EP - 229

JO - Mathematics in Computer Science

JF - Mathematics in Computer Science

IS - 2

ER -

Automatic proof of graph nonisomorphism

Abstract

Access to Document

Fingerprint

Cite this