Journal article
On a class of completable partial edge-colourings
Abstract
We exhibit a large class of completable partial edge-colourings with a “large” number of coloured edges. We introduce almost-Steiner 1-factorizations of the complete graph as 1-factorizations obtained from maximal partial Steiner triple systems with a quadratic leave.
Authors
Rosa A
Journal
Discrete Applied Mathematics, Vol. 35, No. 3, pp. 293–299
Publisher
Elsevier
Publication Date
March 1992
DOI
10.1016/0166-218x(92)90251-5
ISSN
0166-218X