Connectivity augmentation in plane straight line graphs

DOI10.1016/J.ENDM.2008.06.008MaRDI QIDQ5300980zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

connectivity augmentationgeodesic hullsplane straight line graphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

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

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• A Reduction Method for Edge-Connectivity in Graphs
• Augmenting the connectivity of geometric graphs
• Edge-connectivity augmentation problems

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
• A vertex-face assignment for plane graphs
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION

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)