Digraphs of directed treewidth one

DOI10.1016/j.disc.2020.112124zbMath1448.05092OpenAlexW3083761353MaRDI QIDQ2005715

Sebastian Wiederrecht

Publication date: 8 October 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112124

zbMATH Keywords

directed treewidthdirected treebutterfly minor

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Excluding a planar matching minor in bipartite graphs ⋮ How to compute digraph width measures on directed co-graphs

Cites Work

• Packing directed circuits exactly
• Matching structure and the matching lattice
• Directed tree-width
• Adapting the directed grid theorem into an \textsf{FPT} algorithm
• Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
• Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
• Directed tree-width examples
• Brace generation

This page was built for publication: Digraphs of directed treewidth one