Author： Yang Boting
Publisher： Springer Publishing Company
ISSN： 1382-6905
Source： Journal of Combinatorial Optimization, Vol.13, Iss.1, 2007-01, pp. : 47-59
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, we propose a new search model, called strong-mixed search, which is a generalization of the mixed search. We show that the strong-mixed search number of a graph equals the pathwidth of the graph. We also describe relationships between the strong-mixed search number and other search numbers.
Related content
Directed Path-width and Monotonicity in Digraph Searching
By Barát János
Graphs and Combinatorics, Vol. 22, Iss. 2, 2006-06 ,pp. :
Access to resources
Recommend
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. :
Circumference and Pathwidth of Highly Connected Graphs
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. :