1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2012
Arc-Disjoint Paths and Trees in 2-Regular Digraphs
Jørgen Bang-Jensen, Sven Simonsen
An out-(in-)branching B_s^+ (B_s^-) rooted at s in a digraph D is a connected spanning subdigraph of D in which every vertex x != s has precisely one arc entering (leaving) it and…
math.CO2011★ 1 cited
Vertex-disjoint directed and undirected cycles in general digraphs
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni +1
The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the followin…