11 citations · 32 across the 21 of their papers we have counts for
8 papers · 1 filter
Good acyclic orientations of 4-regular 4-connected graphs
Joergen Bang-Jensen, Matthias Kriesell
We study graphs which admit an acyclic orientation that contains an out-branching and in-branching which are arc-disjoint (such an orientation is called {\bf good}). A {\bf 2T-grap…
Safe sets in digraphs
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita +1
A non-empty subset of the vertices of a digraph is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component of , there exists a…
Hajós and Ore constructions for digraphs
Jørgen Bang-Jensen, Thomas Bellitto, Michael Stiebitz +1
The chromatic number of a digraph is the minimum number of colors needed to color the vertices of such that each color class induces an acyclic subdig…
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments
Jørgen Bang-Jensen, Hugues Depres, Anders Yeo
A digraph is {\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a ham…
The directed 2-linkage problem with length constraints
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet +1
The {\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices whether contains a pair of arc-disjoint paths such that is…
Proper-walk connection number of graphs
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
This paper studies the problem of proper-walk connection number: given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there e…