On complete systems of invariants for small graphs

DOI10.1080/00207169708804573zbMath0874.68241OpenAlexW2097211749WikidataQ126244662 ScholiaQ126244662MaRDI QIDQ4347181

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

• Unnamed Item
• 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
• The graph isomorphism disease
• Partitions and Their Representative Graphs

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