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 1, 1986

DOI

10.1007/bf01788106

ISSN

0911-0119

Associated Experts

Alexander Rosa

Professor Emeritus, Faculty of Science

Visit profile

Labels

Fields of Research (FoR)

4901 Applied mathematics 4904 Pure mathematics 49 Mathematical Sciences 4613 Theory of computation

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

Provide website feedback