Planar graph augmentation problems
From MaRDI portal
Recommendations
Cited in
(37)- Triangulating planar graphs while minimizing the maximum degree
- Augmenting a tree to a k-arbor-connected graph with pagenumber k
- Minimum weight connectivity augmentation for planar straight-line graphs
- Reaching 3-connectivity via edge-edge additions
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Completely connected clustered graphs
- An experimental comparison of four graph drawing algorithms.
- Plane augmentation of plane graphs to meet parity constraints
- Defending planar graphs against star-cutsets
- Augmenting outerplanar graphs to meet diameter requirements
- Minimum weight connectivity augmentation for planar straight-line graphs
- Augmenting the connectivity of planar and geometric graphs
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- Planar biconnectivity augmentation with fixed embedding
- scientific article; zbMATH DE number 1303565 (Why is no real title available?)
- Two-Connected Augmentation Problems in Planar Graphs
- FPT algorithms for plane completion problems
- Augmenting Outerplanar Graphs
- Cubic augmentation of planar graphs
- Triangulating planar graphs while minimizing the maximum degree
- Approximation algorithms for graph augmentation
- Augmenting the connectivity of planar and geometric graphs
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Subgraph induced planar connectivity augmentation (extended abstract)
- A polyhedral approach to planar augmentation and related problems
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
- Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
- An exact algorithm for disaster-resilience augmentation of planar straight-line graphs
- Efficient recognition of subgraphs of planar cubic bridgeless graphs
- Graph connectivity and its augmentation: Applications of MA orderings
- Augmenting plane straight-line graphs to meet parity constraints
- Exact algorithms for clustered planarity with linear saturators
- The price of connectivity augmentation on planar graphs
- Regular augmentation of planar graphs
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- On finding augmenting graphs
This page was built for publication: Planar graph augmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037427)
