Every connected, locally connected graph is upper embeddable

DOI10.1002/JGT.3190050211zbMATH Open0459.05036OpenAlexW2121281795MaRDI QIDQ3909074FDOQ3909074

Authors: 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)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3909074)