• Kernels of digraphs with finitely many ends 

      Walicki, Michal (Journal article; Peer reviewed, 2019)
      According to Richardson’s theorem, every digraph without directed odd cycles that is either (a) locally finite or (b) rayless has a kernel (an independent subset with an incoming edge from every vertex in ). We generalize ...