Timeline for Bipartite graphs with prescribed Matching $M$ and genus $g$.
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 17, 2011 at 4:59 | comment | added | François G. Dorais | I guess the basic reference is Thomassen's paper "The graph genus problem is NP-complete." MR1022112 | |
| Jun 19, 2011 at 0:41 | history | answered | David Kohler | CC BY-SA 3.0 |