Connected graphs containing a given connected graph as a unique greatest common subgraph.
Chartrand, Gary ; Johnson, Mark
Aequationes mathematicae, Tome 30 (1986), p. 213-222 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1986-01-01
EUDML-ID : urn:eudml:doc:137160 
@article{GDZPPN002036126,
     title = {Connected graphs containing a given connected graph as a unique greatest common subgraph.},
     journal = {Aequationes mathematicae},
     volume = {30},
     year = {1986},
     pages = {213-222},
     zbl = {0611.05056},
     url = {http://dml.mathdoc.fr/item/GDZPPN002036126}
}

Chartrand, Gary; Johnson, Mark. Connected graphs containing a given connected graph as a unique greatest common subgraph.. Aequationes mathematicae, Tome 30 (1986) pp. 213-222. http://gdmltest.u-ga.fr/item/GDZPPN002036126/