Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs
There have been many attempts to find directed graph classes with bounded directed path-width and bounded directed tree-width. Right now, the only known directed tree-width-/path-width-bounded graphs are cycle-free graphs with directed path-width and directed tree-width 0. In this paper, we introduce directed versions of cactus trees and pseudotrees and -forests and characterize them by at most three forbidden directed graph minors. Furthermore, we show that directed cactus trees and forests have a directed tree-width of at most 1 and directed pseudotrees and -forests even have a directed path-width of at most 1.
KeywordsDirected cactus trees Directed pseudoforests Directed graph minors Directed path-width Directed tree-width
- 5.Gurski, F., Rehs, C.: Computing directed path-width and directed tree-width of recursively defined digraphs. ACM Computing Research Repository, abs/1806.04457, p. 16 (2018)Google Scholar
- 9.Kintali, S., Zhang, Q.: Forbidden directed minors and directed pathwidth. Reseach report (2015)Google Scholar
- 14.Scheffler, P.: Die baumweite von graphen als mass für die kompliziertheit algorithmischer probleme. Ph.D. thesis, Akademie der Wissenschaften in der DDR, Berlin (1989)Google Scholar