The complexity of graph isomorphism for colored graphs with color classes of size 2 and \(3\) (Q4736833)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2086379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of graph isomorphism for colored graphs with color classes of size 2 and \(3\) |
scientific article; zbMATH DE number 2086379 |
Statements
11 August 2004
0 references
0.8818273544311523
0 references
0.8129141330718994
0 references
0.8082383275032043
0 references
The complexity of graph isomorphism for colored graphs with color classes of size 2 and \(3\) (English)
0 references
