Packing, counting and covering Hamilton cycles in random directed graphs
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this is that there is no general tool f...
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Julkaistu: |
Springer Verlag
2017
|