Scholarly Works

On a class of completable partial edge-colourings

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 6, 1992

DOI

10.1016/0166-218x(92)90251-5

ISSN

0166-218X

Associated Experts

Alexander Rosa

Professor Emeritus, Faculty of Science

Labels

Fields of Research (FoR)

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

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback