On complete systems of invariants for small graphs

DOI10.1080/00207169708804573zbMATH Open0874.68241OpenAlexW2097211749WikidataQ126244662 ScholiaQ126244662MaRDI QIDQ4347181FDOQ4347181

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

Recommendations

• scientific article; zbMATH DE number 3875343
• scientific article; zbMATH DE number 3952822
• scientific article; zbMATH DE number 3875344
• scientific article; zbMATH DE number 1539536

zbMATH Keywords

graph isomorphism problem

Mathematics Subject Classification ID

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

Cites Work

• 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
• Constant-time parallel recognition of split graphs
• Title not available (Why is that?)
• A note on the graph isomorphism counting problem

Cited In (1)

• Title not available (Why is that?)

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)