The following pages link to (Q4037427):
Displayed 16 items.
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Completely connected clustered graphs (Q2458931) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Augmenting the Connectivity of Planar and Geometric Graphs (Q5300981) (← links)
- On the Hardness and Approximability of Planar Biconnectivity Augmentation (Q5323069) (← links)