Corpus ID: 118746851

Directed Minors III. Directed Linked Decompositions

@article{Kintali2014DirectedMI,
  title={Directed Minors III. Directed Linked Decompositions},
  author={Shiva Kintali},
  journal={arXiv: Combinatorics},
  year={2014}
}
  • Shiva Kintali
  • Published 2014
  • Mathematics
  • arXiv: Combinatorics
  • 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. 

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    Directed Path-Decompositions

    • Joshua Erde
    • Computer Science, Mathematics
    • SIAM J. Discret. Math.
    • 2020
    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    2 N ov 2 01 7 Directed path-decompositions

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A unified treatment of linked and lean tree-decompositions

    • Joshua Erde
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 2018
    VIEW 2 EXCERPTS
    CITES BACKGROUND & RESULTS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    Two Short Proofs Concerning Tree-Decompositions

    Tournament minors

    VIEW 1 EXCERPT

    Graph minors. IV. Tree-width and well-quasi-ordering

    A menger-like property of tree-width: The finite case

    • Robin Thomas
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 1990