Timeline for Enumerating Connected Circle Graphs
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2011 at 7:21 | comment | added | Brendan McKay | They don't actually say precisely what they are counting, but the numbers indicate they are counting equivalence classes under ordinary graph isomorphism, not just equivalence by rotation of the circle. If the latter is what you really need, there are exceedingly fast generators, start with www.cis.uoguelph.ca/~sawada/papers/chord.pdf , which cites several papers concerned with theoretical enumeration. | |
| Sep 12, 2011 at 19:14 | vote | accept | user695652 | ||
| Sep 12, 2011 at 19:03 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |