Timeline for Polynomial time algorithm for rigid graph isomorphism
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2021 at 10:24 | comment | added | joro | Rigid strongly regular graphs are indeed counterexamples to the current algorithm. Tested with a graph of order 36. | |
| Jul 21, 2021 at 4:04 | history | answered | Brendan McKay | CC BY-SA 4.0 |