Augmenting trees so that every three vertices lie on a cycle

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

doi:10.1016/S0166-218X(00)00332-2

Augmenting trees so that every three vertices lie on a cycle

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

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/S0166-218X(00)00332-2
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

Access to Document

10.1016/S0166-218X(00)00332-2

Cite this

@article{70423990f07c44f09b07d987d706f1ad,

title = "Augmenting trees so that every three vertices lie on a cycle",

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 = "3-cyclable, Cycle, Graph augmentation, Tree",

author = "Peter Dankelmann and Wayne Goddard and Oellermann, \{Ortrud R.\} and Swart, \{Henda C.\}",

year = "2002",

month = jan,

day = "15",

doi = "10.1016/S0166-218X(00)00332-2",

language = "English",

volume = "116",

pages = "145--159",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Augmenting trees so that every three vertices lie on a cycle

AU - Dankelmann, Peter

AU - Goddard, Wayne

AU - Oellermann, Ortrud R.

AU - Swart, Henda C.

PY - 2002/1/15

Y1 - 2002/1/15

N2 - 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.

AB - 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.

KW - 3-cyclable

KW - Cycle

KW - Graph augmentation

KW - Tree

UR - https://www.scopus.com/pages/publications/84867991556

U2 - 10.1016/S0166-218X(00)00332-2

DO - 10.1016/S0166-218X(00)00332-2

M3 - Article

AN - SCOPUS:84867991556

SN - 0166-218X

VL - 116

SP - 145

EP - 159

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -

Augmenting trees so that every three vertices lie on a cycle

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this