Title of article
Augmenting trees so that every three vertices lie on a cycle Original Research Article
Author/Authors
Peter Dankelmann، نويسنده , , Wayne Goddard، نويسنده , , Ortrud R. Oellermann، نويسنده , , Henda C. Swart، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
15
From page
145
To page
159
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.
Keywords
Graph augmentation , Tree , 3-cyclable , Cycle
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885335
Link To Document