On complete systems of invariants for small graphs

DOI10.1080/00207169708804573MaRDI QIDQ4347181zbMATH OpenOpenAlexWikidataFDO

Authors Stavros D. Nikolopoulos, Frank Harary

Publication date 7 August 1997

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804573

zbMATH Keywords

graph isomorphism problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 477971 (Why is no real title available?)
• A note on the graph isomorphism counting problem
• Constant-time parallel recognition of split graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Partitions and Their Representative Graphs
• The graph isomorphism disease

Cited in

(1)

• scientific article; zbMATH DE number 3875343 (Why is no real title available?)

This page was built for publication: On complete systems of invariants for small graphs

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