Quadratic leaves of maximal partial triple systems

Charles J. Colbourn, Alexander Rosa

Research output: Contribution to journalArticlepeer-review

49 Scopus citations


Every graph having vertex degrees zero and two satisfying the basic necessary conditions is the leave of a maximal partial triple system, with one exception (C4 {n-ary union}C5). The proof technique is direct, using the method of differences.

Original languageEnglish (US)
Pages (from-to)317-337
Number of pages21
JournalGraphs and Combinatorics
Issue number1
StatePublished - Dec 1 1986
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Quadratic leaves of maximal partial triple systems'. Together they form a unique fingerprint.

Cite this