On a class of completable partial edge-colourings

On a class of completable partial edge-colourings

0.00 Avg rating0 Votes
Article ID: iaor19921842
Country: Netherlands
Volume: 35
Issue: 2
Start Page Number: 293
End Page Number: 299
Publication Date: Mar 1992
Journal: Discrete Applied Mathematics
Authors:
Abstract:

The paper exhibits a large class of completable partial edge-colourings with a ‘large’ number of coloured edges. It introduces almost-Steiner 1-factorizations of the complete graph as 1-factorizations obtained from maximal partial Steiner triple systems with a quadratic leave.

Reviews

Required fields are marked *. Your email address will not be published.