Geodesic
The total vertex separation number and the profile of graphs
Diskretnaya Matematika, Tome 10 (1998) no. 1, pp. 87-94.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider two graph invariants determined via optimal (in some sense) enumerations of the vertices. They are the total vertex separation number and the profile of a graph. We demonstrate that these two invariants coincide and give some properties of the profile of a graph derived from this coincidence.This research was supported by the Russian Foundation for Basic Research, grant 96–02–00285. 
@article{DM_1998_10_1_a8,
     author = {P. A. Golovach and F. V. Fomin},
     title = {The total vertex separation number and the profile of graphs},
     journal = {Diskretnaya Matematika},
     pages = {87--94},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_1_a8/}
}
TY  - JOUR
AU  - P. A. Golovach
AU  - F. V. Fomin
TI  - The total vertex separation number and the profile of graphs
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 87
EP  - 94
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_1_a8/
LA  - ru
ID  - DM_1998_10_1_a8
ER  - 
%0 Journal Article
%A P. A. Golovach
%A F. V. Fomin
%T The total vertex separation number and the profile of graphs
%J Diskretnaya Matematika
%D 1998
%P 87-94
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1998_10_1_a8/
%G ru
%F DM_1998_10_1_a8
P. A. Golovach; F. V. Fomin. The total vertex separation number and the profile of graphs. Diskretnaya Matematika, Tome 10 (1998) no. 1, pp. 87-94. http://geodesic.mathdoc.fr/item/DM_1998_10_1_a8/