Timeline for Enumerating all inequivalent planar embeddings of a planar graph
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14 at 12:20 | comment | added | Licheng Zhang | Thank you. What I often consider is the first type, unlabeled. Moreover, for $k$-planar graphs, this need will increase. For example, traverse different non-isomorphic 1-planar drawings of some graphs of low-order. (Two drawings of a graph are isomorphic if there is a homeomorphism of the sphere that maps one drawing to the other. ) | |
| May 14 at 4:58 | history | answered | Brendan McKay | CC BY-SA 4.0 |