Directed Width Parameters and Circumference of Digraphs
Combinatorics
2014-01-14 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
Keywords
Cite
@article{arxiv.1401.2662,
title = {Directed Width Parameters and Circumference of Digraphs},
author = {Shiva Kintali},
journal= {arXiv preprint arXiv:1401.2662},
year = {2014}
}