8 problems

Neumann–Lara's conjecture. Every planar digraph of digirth at least $3$ can be vertex-partitioned into two acyclic sets.

Low-density normal-set conjecture. Every plane digraph $G$ admits a normal set of cycles with low density and of size $fvs(G)$.

The minimum-energy conjecture.

Higher-girth packing conjecture. There exists a packing of $g$ pairwise disjoint feedback vertex sets in $D$. Equivalently, $D$ can be vertex $g$-coloured such that every directed…

Two-Colour-Conjecture. Every oriented planar digraph $D$ is $2$-colourable.

Neumann-Lara's conjecture. Every loopless planar digraph admits an NL-$2$-coflow.

Let $D$ be a simple planar digraph on $n$ vertices. An acyclic set is a vertex set inducing no directed cycle in $D$. Hefetz's conjecture. Every simple $n$-vertex planar digraph ha…

Let $D$ be a simple planar digraph. Say that $D$ has no cycles of lengths $4,\dots,k$ when it contains no directed cycles whose lengths are among those integers. Gap-cycle conjectu…