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...
Main Authors: | Ferber, A, Kronenberg, G, Long, E |
---|---|
פורמט: | Journal article |
יצא לאור: |
Springer Verlag
2017
|
פריטים דומים
-
Packing and counting arbitrary Hamilton cycles in random digraphs
מאת: Ferber, A, et al.
יצא לאור: (2018) -
Counting Hamilton decompositions of oriented graphs
מאת: Ferber, A, et al.
יצא לאור: (2017) -
Finding Hamilton cycles in random intersection graphs
מאת: Katarzyna Rybarczyk
יצא לאור: (2018-03-01) -
Packing trees of unbounded degrees in random graphs
מאת: Ferber, Asaf, et al.
יצא לאור: (2022) -
Edge Disjoint Hamilton Cycles in Knödel Graphs
מאת: Palanivel Subramania Nadar Paulraja, et al.
יצא לאור: (2016-07-01)