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...
المؤلفون الرئيسيون: | Ferber, A, Kronenberg, G, Long, E |
---|---|
التنسيق: | Journal article |
منشور في: |
Springer Verlag
2017
|
مواد مشابهة
-
Packing and counting arbitrary Hamilton cycles in random digraphs
حسب: Ferber, A, وآخرون
منشور في: (2018) -
Counting Hamilton decompositions of oriented graphs
حسب: Ferber, A, وآخرون
منشور في: (2017) -
Finding Hamilton cycles in random intersection graphs
حسب: Katarzyna Rybarczyk
منشور في: (2018-03-01) -
Packing trees of unbounded degrees in random graphs
حسب: Ferber, Asaf, وآخرون
منشور في: (2022) -
Edge Disjoint Hamilton Cycles in Knödel Graphs
حسب: Palanivel Subramania Nadar Paulraja, وآخرون
منشور في: (2016-07-01)