Parameterized Orientable Deletion

Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis +2

A graph is $d$-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most $d$. $d$-orientability is a well-studied concept with close…