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 journalArticlepeer-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 languageEnglish
Pages (from-to)145-159
Number of pages15
JournalDiscrete Applied Mathematics
Volume116
Issue number1-2
DOIs
Publication statusPublished - 15 Jan 2002
Externally publishedYes

Keywords

  • 3-cyclable
  • Cycle
  • Graph augmentation
  • Tree

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Augmenting trees so that every three vertices lie on a cycle'. Together they form a unique fingerprint.

Cite this