11 citations · 32 across the 21 of their papers we have counts for
30 papers
Generalized paths and cycles in semicomplete multipartite digraphs
Jørgen Bang-Jensen, Yun Wang, Anders Yeo
It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph ,…
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
By a well known theorem of Robbins, a graph has a strongly connected orientation if and only if is 2-edge-connected and it is easy to find, in linear time, either a cut edg…
Every -strong tournament with minimum out-degree at least is -linked
Jørgen Bang-Jensen, Kasper Skov Johansen
A digraph is -linked if it satisfies that for every choice of disjoint sets and of vertices of there are vertex disjoint pa…
On the inversion number of oriented graphs
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet
Let be an oriented graph. The inversion of a set of vertices in consists in reversing the direction of all arcs with both ends in . The inversion number of , deno…
Digraphs and variable degeneracy
Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz
Let be a digraph, let be an integer, and let be a vector function with . We say that has an -partition if…
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
J. Bang-Jensen, F. Havet, M. Kriesell +1
Generalizing well-known results of Erdős and Lovász, we show that every graph contains a spanning -partite subgraph with , wher…