论文信息 - On a class of completable partial edge-colourings

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.

Alexander Rosa

[1] A Hartmen. Partial triple systems and edge colourings , 1986 .

[2] Alexander Rosa,et al. One-factorizations of the complete graph - A survey , 1985, J. Graph Theory.

[3] C. Lindner,et al. On the number of 1-factorizations of the complete graph☆ , 1976 .

[4] B. Ganter,et al. Co-Ordinatizing Steiner Systems , 1980 .

[5] Alan Hartman. Partial triple systems and edge colourings , 1986, Discret. Math..

[6] Charles J. Colbourn,et al. Embedding Partial Steiner Triple Systems Is NP-Complete , 1983, J. Comb. Theory, Ser. A.

[7] Charles J. Colbourn,et al. Quadratic leaves of maximal partial triple systems , 1986, Graphs Comb..

[8] Peter J. Cameron. Minimal Edge‐Colourings of Complete Graphs , 1975 .

[10] J. Dénes,et al. Latin squares and their applications , 1974 .