A distance between isomorphism classes of trees
Czechoslovak Mathematical Journal (1983)
- Volume: 33, Issue: 1, page 126-130
- ISSN: 0011-4642
Access Full Article
top
How to cite
topZelinka, Bohdan. "A distance between isomorphism classes of trees." Czechoslovak Mathematical Journal 33.1 (1983): 126-130. <http://eudml.org/doc/13369>.
@article{Zelinka1983,
author = {Zelinka, Bohdan},
journal = {Czechoslovak Mathematical Journal},
keywords = {caterpillars; distance measure; shortest path},
language = {eng},
number = {1},
pages = {126-130},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A distance between isomorphism classes of trees},
url = {http://eudml.org/doc/13369},
volume = {33},
year = {1983},
}
TY - JOUR
AU - Zelinka, Bohdan
TI - A distance between isomorphism classes of trees
JO - Czechoslovak Mathematical Journal
PY - 1983
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 33
IS - 1
SP - 126
EP - 130
LA - eng
KW - caterpillars; distance measure; shortest path
UR - http://eudml.org/doc/13369
ER -
References
topCitations in EuDML Documents
top- Bohdan Zelinka, Comparison of various distances between isomorphism classes of graphs
- Bohdan Zelinka, Distances between rooted trees
- Bohdan Zelinka, Edge-distance between isomorphism classes of graphs
- Bohdan Zelinka, The distance between various orientations of a graph
- Bohdan Zelinka, Contraction distance between isomorphism classes of graphs
- Bohdan Zelinka, Edge shift distance between trees
- Bohdan Zelinka, Distances between partially ordered sets
- Bohdan Zelinka, Equivalences between isomorphism classes on infinite graphs
- Gerhard Benadé, Wayne Goddard, Terry A. McKee, Paul A. Winter, On distances between isomorphism classes of graphs
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.