Geodesic
Connected graphs containing a given connected graph as a unique greatest common subgraph.
Aequationes mathematicae, Tome 31 (1986), pp. 213-222 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : greatest common subgraph, induced subgraphs, subdigraphs 
@article{AM2_1986__31_137160,
     author = {Gary Chartrand and Mark Johnson},
     title = {Connected graphs containing a given connected graph as a unique greatest common subgraph.},
     journal = {Aequationes mathematicae},
     pages = {213--222},
     year = {1986},
     volume = {31},
     zbl = {0611.05056},
     url = {http://geodesic.mathdoc.fr/item/AM2_1986__31_137160/}
}
TY  - JOUR
AU  - Gary Chartrand
AU  - Mark Johnson
TI  - Connected graphs containing a given connected graph as a unique greatest common subgraph.
JO  - Aequationes mathematicae
PY  - 1986
SP  - 213
EP  - 222
VL  - 31
UR  - http://geodesic.mathdoc.fr/item/AM2_1986__31_137160/
ID  - AM2_1986__31_137160
ER  - 
%0 Journal Article
%A Gary Chartrand
%A Mark Johnson
%T Connected graphs containing a given connected graph as a unique greatest common subgraph.
%J Aequationes mathematicae
%D 1986
%P 213-222
%V 31
%U http://geodesic.mathdoc.fr/item/AM2_1986__31_137160/
%F AM2_1986__31_137160
Gary Chartrand; Mark Johnson. Connected graphs containing a given connected graph as a unique greatest common subgraph.. Aequationes mathematicae, Tome 31 (1986), pp. 213-222. http://geodesic.mathdoc.fr/item/AM2_1986__31_137160/