Jackson, Bill
Hamilton cycle in small d-diregular graphs ★★
Author(s): Jackson
An directed graph is -diregular if every vertex has indegree and outdegree at least .
Conjecture For , every -diregular oriented graph on at most vertices has a Hamilton cycle.
Keywords:
Long directed cycles in diregular digraphs ★★★
Author(s): Jackson
Conjecture Every strong oriented graph in which each vertex has indegree and outdegree at least contains a directed cycle of length at least .
Keywords: