Abstract
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.