Bonato, A. and Yang, B.T. (2013) Graph Searching and Related Problems. In: Pardalos, P., Du, D.Z. and Graham, R., Eds., Handbook of Combinatorial Optimization, Springer, Berlin, 1511-1558.
https://doi.org/10.1007/978-1-4419-7997-1_76

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.