Pages that link to "Item:Q4485192"
From MaRDI portal
The following pages link to On Four-Connecting a Triconnected Graph (Q4485192):
Displaying 8 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
- The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION (Q2841986) (← links)
