Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 145-159 |
Number of pages | 15 |
Journal | Discrete Applied Mathematics |
Volume | 116 |
Issue number | 1-2 |
DOIs | |
Publication status | Published - 15 Jan 2002 |
Externally published | Yes |
Keywords
- 3-cyclable
- Cycle
- Graph augmentation
- Tree
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics