Ladislav Nebesky. Every connected, locally connected graph is upper embeddable. Journal of Graph Theory, 5(2):205-207, 1981. [doi]
@article{Nebesky81,
title = {Every connected, locally connected graph is upper embeddable},
author = {Ladislav Nebesky},
year = {1981},
doi = {10.1002/jgt.3190050211},
url = {http://dx.doi.org/10.1002/jgt.3190050211},
researchr = {https://researchr.org/publication/Nebesky81},
cites = {0},
citedby = {0},
journal = {Journal of Graph Theory},
volume = {5},
number = {2},
pages = {205-207},
}