Bienstock, D. (1989) Graph Searching, Path-Width, Tree-Width and Related Problems (a Survey). In Reliability of Computer and Communication Networks, Vol. 5 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 33-50.

has been cited by the following article:

• TITLE: Equivalence between Linear Tangle and Maximal Single Ideal

  AUTHORS: Takaaki Fujita, Koichi Yamazaki

  KEYWORDS: Linear Tangle, Maximal Single Ideal, Submodular Function

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.9 No.1, December 25, 2018

  ABSTRACT: The concept of linear tangle was introduced as an obstruction to mixed searching number. The concept of single ideal has been introduced as an obstruction to linear-width. Moreover, it was already known that mixed search number is equivalent to linear-width. Hence, by combining those results, we obtain a proof of the equivalence between linear tangle and single ideal. This short report gives an alternative proof of the equivalence.