1999.bib

1999c
Discrete search programs on graphs
N. N. Petrov and F. V. Fomin
Vestnik St. Petersburg Univ. Math.  32  27--32 (2000)  (1999)

1999b
On a complementary interval graph with the lowest max-degree
P. A. Golovach and F. V. Fomin
Vestnik St. Petersburg Univ. Math.  32  7--10 (2000)  (1999)

1999a
Note on a helicopter search problem on graphs
F. V. Fomin
Discrete Appl. Math.  95  241--249  (1999)