Locally tree-like graphs
Časopis pro pěstování matematiky, Tome 108 (1983) no. 3, pp. 230-238
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Zelinka, Bohdan. Locally tree-like graphs. Časopis pro pěstování matematiky, Tome 108 (1983) no. 3, pp. 230-238. doi: 10.21136/CPM.1983.118169
@article{10_21136_CPM_1983_118169,
author = {Zelinka, Bohdan},
title = {Locally tree-like graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {230--238},
year = {1983},
volume = {108},
number = {3},
doi = {10.21136/CPM.1983.118169},
mrnumber = {716406},
zbl = {0528.05040},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.118169/}
}
[1] G. Chartrand R. E. Pippert: Locally connected graphs. Čas. pěst. mat. 99 (1974), 158-163. | MR
[2] L. Nebeský: Every connected, locally connected graph is upper embeddable. J. Graph Theoгy 5 (1981), 205-208. | MR
[3] J. Sedláček: Lokální vlastnosti gгafů. (Local pгoperties of graphs.) Čas. pěst. mat. 106 (1981), 290-298. | MR
[4] D. W. VanderJagt: Sufficient conditions for locally connected graphs. Čas. pěst. mat. 99 (1974), 400-404. | MR | Zbl
Cité par Sources :