The problem of searching a fugitive in a graph by a team of pursuers is considered. A new criterion of optimal search called the searching expenditure is defined. It is proved that for each graph G, the searching expenditure is equal to the number of edges in the least (with respect to the number of edges) interval graph containing G as a subgraph.
['Fedor V. Fomin']
Searching expenditure and interval graphs