Directed width parameters and circumference of digraphs

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

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2017-01, Vol.659, p.83-87
Main Author: Kintali, Shiva
Format: Article
Language:English
Subjects:
Arboreal decomposition
Circumferences
DAG-decomposition
DAG-width
Directed treewidth
Graph theory
Kelly decomposition
Kelly-width
Parameters
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2016.10.010