The following pages link to (Q4474082):
Displaying 5 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- On the minimum local-vertex-connectivity augmentation in graphs (Q1406041) (← links)
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs (Q4837644) (← links)
- A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a co (Q5692272) (← links)
