Connectivity augmentation in planar straight line graphs
From MaRDI portal
Publication:661949
DOI10.1016/j.ejc.2011.09.002zbMath1234.05193OpenAlexW2022451101MaRDI QIDQ661949
Publication date: 11 February 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.002
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (10)
Reconstruction of Weakly Simple Polygons from Their Edges ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Compatible spanning trees ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Augmenting the edge connectivity of planar straight line graphs to three
- Graph connectivity and its augmentation: Applications of MA orderings
- Augmenting the connectivity of outerplanar graphs
- Removing even crossings
- Augmenting the connectivity of geometric graphs
- Edge-connectivity augmentation problems
- Minimum block containing a given graph
- An edge-splitting algorithm in planar graphs
- The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
- Planar minimally rigid graphs and pseudo-triangulations
- Independence free graphs and vertex connectivity augmentation
- Bemerkungen zum Vierfarbenproblem
- Augmenting undirected node-connectivity by one
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Planar Biconnectivity Augmentation with Fixed Embedding
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- A Reduction Method for Edge-Connectivity in Graphs
- Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
- Augmenting Outerplanar Graphs
- Augmenting the Connectivity of Planar and Geometric Graphs
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Minimum-Perimeter Polygons of Digitized Silhouettes
This page was built for publication: Connectivity augmentation in planar straight line graphs
