Timeline for Is there an efficient way to represent all non-simple cycles of a digraph up to the number of vertices?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2018 at 18:52 | comment | added | Aaron Meyerowitz | Add some directed edges (maybe involving new vertices) which don't belong to any cycles to one graph if you want to change the number of vertices. | |
| Jul 12, 2018 at 15:27 | comment | added | LukeMSki | I should have been clearer in my original post, but I am not looking for graph isomorphisms. I am only interested in graphs that have different number of vertices. | |
| Jul 12, 2018 at 7:48 | history | edited | Brendan McKay | CC BY-SA 4.0 |
added 319 characters in body
|
| Jul 12, 2018 at 7:44 | comment | added | Brendan McKay | @GerhardPaseman I corrected it to non-simple and added the necessary estimates. | |
| Jul 12, 2018 at 5:17 | comment | added | Gerhard Paseman | Indeed, but the poster is talking about nonsimple cycles. Does your intuition carry over from simple to non-simple? Gerhard "Trying To Get Oriented Here" Paseman, 2018.07.11. | |
| Jul 12, 2018 at 4:54 | history | answered | Brendan McKay | CC BY-SA 4.0 |