Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744)
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: Isomorphism of graphs of bounded valence can be tested in polynomial time |
scientific article; zbMATH DE number 3776881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Isomorphism of graphs of bounded valence can be tested in polynomial time |
scientific article; zbMATH DE number 3776881 |
Statements
Isomorphism of graphs of bounded valence can be tested in polynomial time (English)
0 references
1982
0 references
colour automorphism problem for groups with composition factors of bounded order
0 references
orbit
0 references
primitive permutation groups
0 references
graph isomorphism problem
0 references
group actions
0 references
0 references
