1998.bib

1998d
Search costs and interval graphs
F. V. Fomin
Diskretn. Anal. Issled. Oper. Ser. 1  5  70--79, 97  (1998)

1998c
The total vertex separation number and the profile of graphs
P. A. Golovach and F. V. Fomin
Diskret. Mat.  10  87--94  (1998)

1998b
Helicopter search problems, bandwidth and pathwidth
F. V. Fomin
Discrete Appl. Math.  85  59--70  (1998)

1998a
Search problems on {$1$}-skeletons of regular polyhedrons
F. V. Fomin and P. A. Golovach and N. N. Petrov
Int. J. Math. Game Theory Algebra  7  101--111  (1998)