Timeline for Counting problems where unlabeled is easier than labeled
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2016 at 22:41 | history | edited | Ira Gessel | CC BY-SA 3.0 |
added 344 characters in body
|
| Mar 8, 2016 at 15:30 | history | edited | Ira Gessel | CC BY-SA 3.0 |
deleted 47 characters in body
|
| Mar 8, 2016 at 15:29 | comment | added | Ira Gessel | A labeled self-complementary graph is a graph that is isomorphic to its complement. | |
| Mar 8, 2016 at 14:59 | comment | added | Fedor Petrov | What is labelled analogue of self-complementary graph? For me, 'self-complementary graph with labelled vertices' looks less natural than 'self-complementray graph with labelled vertices and given isomorphism between the graph and its complement'. | |
| Mar 8, 2016 at 14:52 | history | answered | Ira Gessel | CC BY-SA 3.0 |