Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\)
type: Item
instance of: scholarly article
title: Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\)
zbMATH Open document ID: 0595.68057
DOI: 10.1007/BF01095641
published in: Journal of Soviet Mathematics
publication date: 1986-01-01T00:00:00Z
review text: Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 137, 99-114 (Russian) (1984; Zbl 0551.68060).
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 3958745
zbMATH Keywords: graph isomorphism
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: undirected graphs
zbMATH Keywords: graphs of bounded valence
zbMATH Keywords: time complexity
author: Ilya Ponomarenko
MaRDI profile type: Publication
cites work: Groups of graphs on given surfaces
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
description: scientific article; zbMATH DE number 3958745