On the Kernel and Related Problems in Interval Digraphs

Mathew C. Francis, Pavol Hell, Dalu Jacob

Given a digraph $G$, a set $X\subseteq V(G)$ is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in $X$ or is an in-neighbour (resp. out-neigh…