Augmenting trees so that every three vertices lie on a cycle
From MaRDI portal
Publication:5957303
DOI10.1016/S0166-218X(00)00332-2zbMath0990.05030MaRDI QIDQ5957303
Wayne Goddard, Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart
Publication date: 8 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Cites Work
- Edge-connectivity augmentation problems
- Minimum block containing a given graph
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
- On the optimal vertex-connectivity augmentation
- Minimal edge-coverings of pairs of sets
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Cycles and Connectivity in Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item