Augmenting trees so that every three vertices lie on a cycle

DOI10.1016/S0166-218X(00)00332-2zbMath0990.05030OpenAlexW2010228969MaRDI QIDQ5957303

Peter Dankelmann, Henda C. Swart, Wayne Goddard, Ortrud R. Oellermann

Publication date: 8 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00332-2

zbMATH Keywords

treecyclegraph algorithmgraph augmentation3-cyclable

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

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

This page was built for publication: Augmenting trees so that every three vertices lie on a cycle