Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
From MaRDI portal
Publication:707019
Recommendations
- On planarity of graphs in 3-manifolds
- On the connectivity of manifold graphs
- On the 3-local profiles of graphs
- Two local properties of graphs
- The structure of locally finite two-connected graphs
- Manifolds with conullity at most two as graph manifolds
- $N_2$-locally connected graphs and their upper embeddability
- Notes on the complexity of 3-valent graphs in 3-manifolds
- A local property of polyhedral maps on compact two-dimensional manifolds
- Local properties and upper embeddability of connected multigraphs
Cites work
- scientific article; zbMATH DE number 3882450 (Why is no real title available?)
- scientific article; zbMATH DE number 16301 (Why is no real title available?)
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 1943979 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- 2-connected spanning subgraphs of planar 3-connected graphs
- 2‐connected coverings of bounded degree in 3‐connected graphs
- A local property of polyhedral maps on compact two-dimensional manifolds
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Extending Kotzig's theorem
- Face-width of embedded graphs
- Light paths with an odd number of vertices in polyhedral maps
- Light subgraphs of multigraphs on compact 2-dimensional manifolds
- On 2-connected spanning subgraphs with low maximum degree
- On \(3\)-connected plane graphs without triangular faces
- Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- Subgraphs with restricted degrees of their vertices in planar graphs
- Subgraphs with restricted degrees of their vertices in polyhedral maps on compact 2-manifolds
- Trees in Polyhedral Graphs
- Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
Cited in
(7)- On minimally 3-connected graphs on a surface
- scientific article; zbMATH DE number 2016564 (Why is no real title available?)
- Light subgraphs of multigraphs embedded in compact 2-manifolds
- Subgraphs with restricted degrees of their vertices in polyhedral maps on compact 2-manifolds
- On \(3\)-connected plane graphs without triangular faces
- 2-connected 7-coverings of 3-connected graphs on surfaces
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
This page was built for publication: Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707019)