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

類似資料