N₂-locally connected graphs and their upper embeddability
From MaRDI portal
$N 2$-locally connected graphs and their upper embeddability
Recommendations
Cites work
- A Characterization in of Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- Every connected, locally connected graph is upper embeddable
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 3877215 (Why is no real title available?)
- scientific article; zbMATH DE number 4004226 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- Locally connected graphs
- On locally quasiconnected graphs and their upper embeddability
- Sufficient conditions for locally connected graphs
Cited in
(10)- \(N_ 2\)-locally disconnected graphs
- Maximum genus and chromatic number of graphs
- The structure of locally finite two-connected graphs
- Locally connectivity and up-embeddability of a graph
- On locally quasiconnected graphs and their upper embeddability
- Local properties and upper embeddability of connected multigraphs
- On minimum locally n-(arc)-strong digraphs
- scientific article; zbMATH DE number 6107241 (Why is no real title available?)
- scientific article; zbMATH DE number 846937 (Why is no real title available?)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
This page was built for publication: $N_2$-locally connected graphs and their upper embeddability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021401)
