Augmenting trees so that every three vertices lie on a cycle
The minimum number of edges that must be added to a tree so that every three vertices lie on a cycle is determined. The proof is constructive.
tree cycle graph augmentation 3-cyclable