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)