
On the inversion number of oriented graphs
Let D be an oriented graph. The inversion of a set X of vertices in D co...
read it

On the parameterized complexity of 2partitions
We give an FPT algorithm for deciding whether the vertex set a digraph D...
read it

Safe sets in digraphs
A nonempty subset S of the vertices of a digraph D is called a safe se...
read it

The directed 2linkage problem with length constraints
The weak 2linkage problem for digraphs asks for a given digraph and ve...
read it

Connecting edgecolouring
This paper studies the problem of connecting edgecolouring. Given an un...
read it

Spanning eulerian subdigraphs in semicomplete digraphs
A digraph is eulerian if it is connected and every vertex has its indeg...
read it
Jørgen BangJensen
is this you? claim profile