Stable set meeting all longest directed paths. ★★
Author(s): Laborde; Payan; Xuong N.H.
Conjecture Every digraph has a stable set meeting all longest directed paths
Keywords:
Ádám's Conjecture ★★★
Author(s): Ádám
Conjecture Every digraph with at least one directed cycle has an arc whose reversal reduces the number of directed cycles.
Keywords:
Caccetta-Häggkvist Conjecture ★★★★
Author(s): Caccetta; Häggkvist
Conjecture Every simple digraph of order with minimum outdegree at least has a cycle with length at most
Keywords:
Directed path of length twice the minimum outdegree ★★★
Author(s): Thomassé
Conjecture Every oriented graph with minimum outdegree contains a directed path of length .
Keywords: