Connected graphs containing a given connected graph as a unique greatest common subgraph.
Aequationes mathematicae (1986)
- Volume: 31, page 213-222
- ISSN: 0001-9054; 1420-8903/e
Access Full Article
top
How to cite
topChartrand, Gary, and Johnson, Mark. "Connected graphs containing a given connected graph as a unique greatest common subgraph.." Aequationes mathematicae 31 (1986): 213-222. <http://eudml.org/doc/137160>.
@article{Chartrand1986,
author = {Chartrand, Gary, Johnson, Mark},
journal = {Aequationes mathematicae},
keywords = {greatest common subgraph; induced subgraphs; subdigraphs},
pages = {213-222},
title = {Connected graphs containing a given connected graph as a unique greatest common subgraph.},
url = {http://eudml.org/doc/137160},
volume = {31},
year = {1986},
}
TY - JOUR
AU - Chartrand, Gary
AU - Johnson, Mark
TI - Connected graphs containing a given connected graph as a unique greatest common subgraph.
JO - Aequationes mathematicae
PY - 1986
VL - 31
SP - 213
EP - 222
KW - greatest common subgraph; induced subgraphs; subdigraphs
UR - http://eudml.org/doc/137160
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.