Timeline for Decompose complete directed graph with n vertices into n edge-disjoint cycles with length n−1
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2023 at 21:29 | comment | added | LSpice | DOI for AGSV: doi.org/10.1016/S0097-3165(03)00098-0. | |
| Apr 23, 2023 at 20:54 | comment | added | chunma | Thanks a lot for pointing this out. The construction in this paper is similar to the one I referred in the question. Unfortunately, this construction does not satisfy the property described (i.e., there is no repeated element in each column) | |
| Apr 23, 2023 at 1:02 | history | answered | Gerry Myerson | CC BY-SA 4.0 |