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)