
Every prism over a 3-connected planar graph is hamiltonian. ★★
Author(s): Kaiser; Král; Rosenfeld; Ryjácek; Voss
Conjecture If
is a
-connected planar graph, then
has a Hamilton cycle.



Keywords:
Hoàng-Reed Conjecture ★★★
Conjecture Every digraph in which each vertex has outdegree at least
contains
directed cycles
such that
meets
in at most one vertex,
.






Keywords:
Edge-disjoint Hamilton cycles in highly strongly connected tournaments. ★★
Author(s): Thomassen
Conjecture For every
, there is an integer
so that every strongly
-connected tournament has
edge-disjoint Hamilton cycles.




Keywords:
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: