Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie

DOI10.1007/BF02244021MaRDI QIDQ1248626zbMATH OpenOpenAlexFDO

Authors J. Hinteregger, Gottfried Tinhofer

Publication date 1977

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02244021

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites work

• scientific article; zbMATH DE number 3528255 (Why is no real title available?)
• scientific article; zbMATH DE number 3570486 (Why is no real title available?)
• An Efficient Algorithm for Graph Isomorphism
• Ein Verfahren zur Feststellung der Isomorphie von endlichen, zusammenhängenden Graphen. (A method to establish the isomorphy of finite connected graphs.)
• Graph isomorphism: A heuristic edge-partitioning-oriented algorithm
• Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
• Zur Bestimmung der Automorphismen eines endlichen Graphen

This page was built for publication: Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie

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