Elsevier

Theoretical Computer Science

Volume 659, 10 January 2017, Pages 83-87
Theoretical Computer Science

Note
Directed width parameters and circumference of digraphs

https://doi.org/10.1016/j.tcs.2016.10.010Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.

Keywords

Arboreal decomposition
Directed treewidth
DAG-decomposition
DAG-width
Kelly decomposition
Kelly-width

Cited by (0)

© 2016 Elsevier B.V.