11 citations · 32 across the 21 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015★ 4 cited
Completing orientations of partially oriented graphs
Joergen Bang-Jensen, J. Huang, Xuding Zhu
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partial…
cs.DM2015
DAG-width and circumference of digraphs
Jørgen Bang-Jensen, Tilde My Larsen
We prove that every digraph of circumference has DAG-width at most and this is best possible. As a consequence of our result we deduce that the -linkage problem is polyn…