Quadratic leaves of maximal partial triple systems
type: Item
instance of: scholarly article
title: Quadratic leaves of maximal partial triple systems
zbMATH Open document ID: 0609.05009
DOI: 10.1007/BF01788106
author: Charles J. Colbourn
author: Alexander Rosa
published in: Graphs and Combinatorics
publication date: 1986-01-01T00:00:00Z
review text: The authors prove that every graph having vertex degrees zero and two, an odd number of vertices, number of edges congruent to v(v-1)/2 mod 3, and no triangles, is the leave of a maximal partial triple system. The only exception to this result is the union of a four cycle and a five cycle on nine vertices. The proof is by direct construction, using difference techniques and the results of Simpson on the existence of Langford sequences. Many cases have to be considered due to the direct nature of the proof, but the authors have done a fine job of unifying cases without detracting from the clarity of the exposition.
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 3985226
zbMATH Keywords: maximal partial triple system
zbMATH Keywords: Langford sequences
MaRDI profile type: Publication
cites work: Embedding Partial Steiner Triple Systems
cites work: Every generalized Petersen graph has a Tait coloring
cites work: Embedding partial Steiner triple systems is NP-complete
cites work: Completing small partial triple systems
cites work: The strong chromatic number of partial triple systems
cites work: Q3745851
cites work: Element neighbourhoods in twofold triple systems
cites work: On Cyclic Steiner 2-Designs
cites work: Q3901525
cites work: Q5181736
cites work: Langford sequences: Perfect and hooked
cites work: Maximal consistent families of triples
cites work: Q3966151
description: scientific article; zbMATH DE number 3985226