2 papers
cs.DM2020
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…
math.CO2019
Good orientations of 2T-graphs
J. Bang-Jensen, S. Bessy, J. Huang +1
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus…