On locally quasiconnected graphs and their upper embeddability

DOI10.21136/cmj.1985.102005zbMath0584.05031OpenAlexW2735737966MaRDI QIDQ3708824

Ladislav Nebeský

Publication date: 1985

Full work available at URL: https://eudml.org/doc/13501

zbMATH Keywords

maximum genusupper embeddable graphslocally quasiconnected graphs

Mathematics Subject Classification ID

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

Related Items (8)

On minimum locally $n$-(arc)-strong digraphs ⋮ Upper embeddability of graphs ⋮ Maximum genus and chromatic number of graphs ⋮ Up-embeddability of a graph by order and girth ⋮ Local properties and upper embeddability of connected multigraphs ⋮ Unnamed Item ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ $N_2$-locally connected graphs and their upper embeddability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Locally tree-like graphs
• Every connected, locally connected graph is upper embeddable
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Survey of results on the maximum genus of a graph
• Locally connected graphs

This page was built for publication: On locally quasiconnected graphs and their upper embeddability