Timeline for Generate all non-isomorphic caterpillar trees with $n$ vertices
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 12 at 13:36 | comment | added | Max Alekseyev | @PeterTaylor: Indeed, thanks for the suggestion! I've updated the code, although for the case of $n=11$ with just $528$ graphs, it does not matter much. | |
| Jun 12 at 13:34 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
updated code
|
| Jun 12 at 10:32 | comment | added | Peter Taylor |
It's very much overkill to do canonical labelling to eliminate duplicates. if tuple(V) > tuple(reversed(V)): continue suffices.
|
|
| Jun 11 at 6:58 | vote | accept | Licheng Zhang | ||
| Jun 10 at 14:56 | history | answered | Max Alekseyev | CC BY-SA 4.0 |