Timeline for How to edge-color a directed acyclic graph so that every path visits none or all edges of each color?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2020 at 8:35 | comment | added | John K. | Every node that hasn't is irrelevant (except the sink). | |
| Sep 27, 2020 at 2:22 | comment | added | xskxzr | It seems this algorithm assumes every node has out-degree at least 1. | |
| Sep 20, 2020 at 21:37 | history | edited | John K. | CC BY-SA 4.0 |
added 11 characters in body
|
| Sep 20, 2020 at 21:31 | history | edited | John K. | CC BY-SA 4.0 |
Fixed the case where a path "branches out" before $a$ and "branches in" between $a$ and $b$
|
| Sep 20, 2020 at 21:00 | history | answered | John K. | CC BY-SA 4.0 |