Automatic proof of graph nonisomorphism

DOI10.1007/S11786-008-0052-8zbMATH Open1189.05114OpenAlexW2160481583MaRDI QIDQ841683FDOQ841683

Authors: Arjeh M. Cohen, Jan Willem Knopper, Murray, Scott H. 

Publication date: 18 September 2009

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-008-0052-8

Recommendations

• A proof system for graph (non)-isomorphism verification
• An elementary proof of a conjecture on graph-automorphism
• scientific article; zbMATH DE number 2149407
• scientific article; zbMATH DE number 3853103
• Automaticity for graphs of groups
• scientific article; zbMATH DE number 5158891
• Identifying graph automorphisms using determining sets
• A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata
• Computing graph automorphism from partial solutions
• On automatic transitive graphs

zbMATH Keywords

graphsgroupsgraph isomorphismautomatic proof generation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Mechanization of proofs and logical operations (03B35)

Cited In (1)

• A proof system for graph (non)-isomorphism verification

Uses Software

• nauty

This page was built for publication: Automatic proof of graph nonisomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841683)