An enumeration theorem for rooted graphs
Mathematica Slovaca (1983)
- Volume: 33, Issue: 1, page 29-34
- ISSN: 0232-0525
Access Full Article
top
How to cite
topŠiráň, Jozef. "An enumeration theorem for rooted graphs." Mathematica Slovaca 33.1 (1983): 29-34. <http://eudml.org/doc/34146>.
@article{Širáň1983,
author = {Širáň, Jozef},
journal = {Mathematica Slovaca},
keywords = {rooted graphs; non-isomorphic 1-amalgamations},
language = {eng},
number = {1},
pages = {29-34},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {An enumeration theorem for rooted graphs},
url = {http://eudml.org/doc/34146},
volume = {33},
year = {1983},
}
TY - JOUR
AU - Širáň, Jozef
TI - An enumeration theorem for rooted graphs
JO - Mathematica Slovaca
PY - 1983
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 33
IS - 1
SP - 29
EP - 34
LA - eng
KW - rooted graphs; non-isomorphic 1-amalgamations
UR - http://eudml.org/doc/34146
ER -
References
top- HARARY F., Graph Theory, Addison-Wesley, Reading, Mass., 1969. (1969) Zbl0196.27202MR0256911
- HARARY F., PALMER E. M., Graphical Enumeration, Academic Press, New York and London, 1973. (1973) Zbl0266.05108MR0357214
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.