$N_2$-locally connected graphs and their upper embeddability

DOI10.21136/cmj.1991.102504zbMath0760.05030OpenAlexW3047720037MaRDI QIDQ4021401

Ladislav Nebeský

Publication date: 16 January 1993

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

zbMATH Keywords

connected graphsupper embeddability2-cell

Mathematics Subject Classification ID

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

Related Items (4)

On minimum locally $n$-(arc)-strong digraphs ⋮ Maximum genus and chromatic number of graphs ⋮ Local properties and upper embeddability of connected multigraphs ⋮ Unnamed Item

Cites Work

• How to determine the maximum genus of a graph
• On locally quasiconnected graphs and their upper embeddability
• Every connected, locally connected graph is upper embeddable
• A new characterization of the maximum genus of a graph
• Sufficient conditions for locally connected graphs
• A Characterization in of Upper-Embeddable Graphs
• Locally connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: $N_2$-locally connected graphs and their upper embeddability