Journal article
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 ⋃C5). The proof technique is direct, using the method of differences.
Authors
Colbourn CJ; Rosa A
Journal
Graphs and Combinatorics, Vol. 2, No. 1, pp. 317–337
Publisher
Springer Nature
Publication Date
December 1986
DOI
10.1007/bf01788106
ISSN
0911-0119