Greatest common subgraphs of graphs
Gary Chartrand; Farrokh Saba; Hung Bin Zou
Časopis pro pěstování matematiky (1987)
- Volume: 112, Issue: 1, page 80-88
- ISSN: 0528-2195
Access Full Article
top
How to cite
topChartrand, Gary, Saba, Farrokh, and Zou, Hung Bin. "Greatest common subgraphs of graphs." Časopis pro pěstování matematiky 112.1 (1987): 80-88. <http://eudml.org/doc/21662>.
@article{Chartrand1987,
author = {Chartrand, Gary, Saba, Farrokh, Zou, Hung Bin},
journal = {Časopis pro pěstování matematiky},
keywords = {greatest common subgraph},
language = {eng},
number = {1},
pages = {80-88},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {Greatest common subgraphs of graphs},
url = {http://eudml.org/doc/21662},
volume = {112},
year = {1987},
}
TY - JOUR
AU - Chartrand, Gary
AU - Saba, Farrokh
AU - Zou, Hung Bin
TI - Greatest common subgraphs of graphs
JO - Časopis pro pěstování matematiky
PY - 1987
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 112
IS - 1
SP - 80
EP - 88
LA - eng
KW - greatest common subgraph
UR - http://eudml.org/doc/21662
ER -
References
top- M. Behzad G. Chartrand, L. Lesniak-Foster, Graphs & Digraphs, Wadsworth, Belmont, CA (1979). (1979) MR0525578
- G. Chartrand F. Saba, H.-B. Zou, Edge rotations and distance between graphs, Čas. pěst. mat. 110 (1985), 87-91. (1985) MR0791281
Citations in EuDML Documents
topNotesEmbed ?
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.