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...
Những tác giả chính: | Ferber, A, Kronenberg, G, Long, E |
---|---|
Định dạng: | Journal article |
Được phát hành: |
Springer Verlag
2017
|
Những quyển sách tương tự
-
Packing and counting arbitrary Hamilton cycles in random digraphs
Bằng: Ferber, A, et al.
Được phát hành: (2018) -
Counting Hamilton decompositions of oriented graphs
Bằng: Ferber, A, et al.
Được phát hành: (2017) -
Finding Hamilton cycles in random intersection graphs
Bằng: Katarzyna Rybarczyk
Được phát hành: (2018-03-01) -
Packing trees of unbounded degrees in random graphs
Bằng: Ferber, Asaf, et al.
Được phát hành: (2022) -
Edge Disjoint Hamilton Cycles in Knödel Graphs
Bằng: Palanivel Subramania Nadar Paulraja, et al.
Được phát hành: (2016-07-01)