Directed Minors III. Directed Linked Decompositions

Shiva Kintali

Directed Minors III. Directed Linked Decompositions

Combinatorics 2014-04-25 v1

Authors: Shiva Kintali

Abstract

Thomas proved that every undirected graph admits a linked tree decomposition of width equal to its treewidth. In this paper, we generalize Thomas's theorem to digraphs. We prove that every digraph G admits a linked directed path decomposition and a linked DAG decomposition of width equal to its directed pathwidth and DAG-width respectively.

Keywords

graph theory

Cite

@article{arxiv.1404.5976,
  title  = {Directed Minors III. Directed Linked Decompositions},
  author = {Shiva Kintali},
  journal= {arXiv preprint arXiv:1404.5976},
  year   = {2014}
}

Related papers

View all related →