Quadratic leaves of maximal partial triple systems

Charles J. Colbourn; Alexander Rosa

doi:10.1007/BF01788106

Quadratic leaves of maximal partial triple systems

Charles J. Colbourn, Alexander Rosa

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

49 Scopus citations

Abstract

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 (C₄ {n-ary union}C₅). The proof technique is direct, using the method of differences.

Original language	English (US)
Pages (from-to)	317-337
Number of pages	21
Journal	Graphs and Combinatorics
Volume	2
Issue number	1
DOIs	https://doi.org/10.1007/BF01788106
State	Published - Dec 1 1986
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF01788106

Cite this

@article{3a56ac4b3f1b4b50a12ab0d663062577,

title = "Quadratic leaves of maximal partial triple systems",

abstract = "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.",

author = "Colbourn, {Charles J.} and Alexander Rosa",

year = "1986",

month = dec,

day = "1",

doi = "10.1007/BF01788106",

language = "English (US)",

volume = "2",

pages = "317--337",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - Quadratic leaves of maximal partial triple systems

AU - Colbourn, Charles J.

AU - Rosa, Alexander

PY - 1986/12/1

Y1 - 1986/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0012962201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012962201&partnerID=8YFLogxK

U2 - 10.1007/BF01788106

DO - 10.1007/BF01788106

M3 - Article

AN - SCOPUS:0012962201

SN - 0911-0119

VL - 2

SP - 317

EP - 337

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Quadratic leaves of maximal partial triple systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this