The following pages link to (Q4207930):
Displaying 6 items.
- Tri-connectivity augmentation in trees (Q327625) (← links)
- A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- (Q4537741) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)
