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...
Váldodahkkit: | Ferber, A, Kronenberg, G, Long, E |
---|---|
Materiálatiipa: | Journal article |
Almmustuhtton: |
Springer Verlag
2017
|
Geahča maid
-
Packing and counting arbitrary Hamilton cycles in random digraphs
Dahkki: Ferber, A, et al.
Almmustuhtton: (2018) -
Counting Hamilton decompositions of oriented graphs
Dahkki: Ferber, A, et al.
Almmustuhtton: (2017) -
Finding Hamilton cycles in random intersection graphs
Dahkki: Katarzyna Rybarczyk
Almmustuhtton: (2018-03-01) -
Packing trees of unbounded degrees in random graphs
Dahkki: Ferber, Asaf, et al.
Almmustuhtton: (2022) -
Edge Disjoint Hamilton Cycles in Knödel Graphs
Dahkki: Palanivel Subramania Nadar Paulraja, et al.
Almmustuhtton: (2016-07-01)