Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Larsen, Tilde My"'
Autor:
Bang-Jensen, Jørgen, Larsen, Tilde My
We prove that every digraph of circumference $l$ has DAG-width at most $l$ and this is best possible. As a consequence of our result we deduce that the $k$-linkage problem is polynomially solvable for every fixed $k$ in the class of digraphs with bou
Externí odkaz:
http://arxiv.org/abs/1502.03241
Autor:
Bang‐Jensen, Jørgen1 jbj@imada.sdu.dk, Larsen, Tilde My1 tilla@imada.sdu.dk
Publikováno v:
Journal of Graph Theory. Jun2016, Vol. 82 Issue 2, p194-206. 13p.
