Connectivity augmentation in plane straight line graphs
From MaRDI portal
Publication:5300980
DOI10.1016/J.ENDM.2008.06.008zbMATH Open1267.05158OpenAlexW2046895810MaRDI QIDQ5300980FDOQ5300980
Authors: Csaba D. Tóth 
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.008
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
Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
Cited In (15)
- Compatible connectivity augmentation of planar disconnected graphs
- Compatible connectivity-augmentation of planar disconnected graphs
- Minimum weight connectivity augmentation for planar straight-line graphs
- Geometric biplane graphs. II: Graph augmentation
- Regular augmentation of planar graphs
- Minimum weight connectivity augmentation for planar straight-line graphs
- Constrained tri-connected planar straight line graphs
- Augmenting the connectivity of geometric graphs
- Tri-edge-connectivity augmentation for planar straight line graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
- Augmenting the connectivity of outerplanar graphs
- Encompassing colored planar straight line graphs
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
- A vertex-face assignment for plane 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)
