Geodesic
Maximal outerplane graphs with two simplicial vertices
Prikladnaâ diskretnaâ matematika, no. 3 (2015), pp. 95-109

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

The class of maximal outerplane graphs with two simplicial vertices is considered. The following results are obtained for graphs of this class: recursive characterization, a formula for computation of unlabeled graphs, a complete invariant that differs from the known complete invariant of arbitrary maximal outerplane graphs, and a polynomial algorithm for computation of the complete invariant.
Keywords: maximal outerplanar graphs, $2$-path, enumeration, unlabeled graphs, complete invariant. 
@article{PDM_2015_3_a7,
     author = {Y. L. Nosov},
     title = {Maximal outerplane graphs with two simplicial vertices},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {95--109},
     publisher = {mathdoc},
     number = {3},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2015_3_a7/}
}
TY  - JOUR
AU  - Y. L. Nosov
TI  - Maximal outerplane graphs with two simplicial vertices
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2015
SP  - 95
EP  - 109
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2015_3_a7/
LA  - ru
ID  - PDM_2015_3_a7
ER  - 
%0 Journal Article
%A Y. L. Nosov
%T Maximal outerplane graphs with two simplicial vertices
%J Prikladnaâ diskretnaâ matematika
%D 2015
%P 95-109
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2015_3_a7/
%G ru
%F PDM_2015_3_a7
Y. L. Nosov. Maximal outerplane graphs with two simplicial vertices. Prikladnaâ diskretnaâ matematika, no. 3 (2015), pp. 95-109. http://geodesic.mathdoc.fr/item/PDM_2015_3_a7/