Every connected, locally connected graph is upper embeddable

DOI10.1002/jgt.3190050211zbMath0459.05036OpenAlexW2121281795MaRDI QIDQ3909074

Ladislav Nebeský

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190050211

zbMATH Keywords

locally connected graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (7)

On minimum locally $n$-(arc)-strong digraphs ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Maximum genus and chromatic number of graphs ⋮ Up-embeddability of a graph by order and girth ⋮ On locally quasiconnected graphs and their upper embeddability ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ $N_2$-locally connected graphs and their upper embeddability

This page was built for publication: Every connected, locally connected graph is upper embeddable