Connectivity augmentation in plane straight line graphs
From MaRDI portal
Publication:5300980
Recommendations
- Connectivity augmentation in planar straight line graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- Tri-edge-connectivity augmentation for planar straight line graphs
- Augmenting the connectivity of geometric graphs
- Minimum weight connectivity augmentation for planar straight-line graphs
Cites work
Cited in
(15)- Compatible connectivity augmentation of planar disconnected graphs
- Geometric biplane graphs. II: Graph augmentation
- Augmenting the connectivity of outerplanar graphs
- Augmenting the connectivity of geometric graphs
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
- A vertex-face assignment for plane graphs
- Minimum weight connectivity augmentation for planar straight-line graphs
- Regular augmentation of planar graphs
- Tri-edge-connectivity augmentation for planar straight line graphs
- Compatible connectivity-augmentation of planar disconnected graphs
- Constrained tri-connected planar straight line graphs
- Encompassing colored planar straight line graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- Minimum weight connectivity augmentation for planar straight-line graphs
- Connectivity augmentation in planar straight line graphs
This page was built for publication: Connectivity augmentation in plane straight line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300980)