Timeline for Visit all vertices on directed graph
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2018 at 2:43 | comment | added | James LT | Eulerian path is to visit each edge once, not each vertex. | |
| Jan 7, 2017 at 20:28 | comment | added | Yuval Filmus | Can you explain why your criterion works? | |
| Jan 7, 2017 at 19:47 | review | Late answers | |||
| Jan 7, 2017 at 20:28 | |||||
| Jan 7, 2017 at 19:32 | review | First posts | |||
| Jan 7, 2017 at 22:12 | |||||
| Jan 7, 2017 at 19:27 | history | answered | Vishakha Banka | CC BY-SA 3.0 |