Geodesic
On the ordered set of connected parts of a polygonal graph
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 87-89 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Polygonal graphs, whose the ordered set of abstract connected parts is a lattice, are characterized.
Keywords: polygonal graph, linear graph, binary vector, duality, ordered set, lattice. 
@article{PDMA_2013_6_a41,
     author = {V. N. Salii},
     title = {On the ordered set of connected parts of a polygonal graph},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {87--89},
     year = {2013},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a41/}
}
TY  - JOUR
AU  - V. N. Salii
TI  - On the ordered set of connected parts of a polygonal graph
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 87
EP  - 89
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a41/
LA  - ru
ID  - PDMA_2013_6_a41
ER  - 
%0 Journal Article
%A V. N. Salii
%T On the ordered set of connected parts of a polygonal graph
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 87-89
%N 6
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a41/
%G ru
%F PDMA_2013_6_a41
V. N. Salii. On the ordered set of connected parts of a polygonal graph. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 87-89. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a41/

[1] Salii V. N., “Sistema abstraktnykh svyaznykh podgrafov lineinogo grafa”, Prikladnaya diskretnaya matematika, 2012, no. 2(16), 90–94