Isomorphism of graphs of bounded valence can be tested in polynomial time (Q56503919)
Jump to navigation
Jump to search
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Isomorphism of graphs of bounded valence can be tested in polynomial time |
No description defined |
Statements
Isomorphism of graphs of bounded valence can be tested in polynomial time (English)
0 references
August 1982
0 references
24
0 references
25
0 references
1
0 references
42-65
0 references