Packing, counting and covering Hamilton cycles in random directed graphs
Sign Up to like & getrecommendations! Published in 2017 at "Israel Journal of Mathematics"
DOI: 10.1007/s11856-017-1518-7
Abstract: 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… read more here.
Keywords: hamilton; random directed; packing counting; hamilton cycles ... See more keywords