Non-separating spanning trees and out-branchings in digraphsof independence number 2

Joergen Bang-Jensen, Stéphane Bessy, Anders Yeo

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that is, the graph obtained from G by deleting the edges in F, is connected. Analogously we say that a subdigraph…