Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) (Q1077933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) |
scientific article; zbMATH DE number 3958745
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) |
scientific article; zbMATH DE number 3958745 |
Statements
Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) (English)
0 references
1986
0 references
Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 137, 99-114 (Russian) (1984; Zbl 0551.68060).
0 references
graph isomorphism
0 references
polynomial-time algorithm
0 references
undirected graphs
0 references
graphs of bounded valence
0 references
time complexity
0 references
