论文信息 - Quadratic leaves of maximal partial triple systems - 字舞流文

Quadratic leaves of maximal partial triple systems

Every graph having vertex degrees zero and two satisfying the basic necessary conditions is the leave of a maximal partial triple system, with one exception (C4 ⋃C5). The proof technique is direct, using the method of differences.

Charles J. Colbourn | Alexander Rosa | C. Colbourn | A. Rosa

[1] Charles J. Colbourn,et al. The strong chromatic number of partial triple systems , 1988, Discret. Appl. Math..

[2] Charles J. Colbourn,et al. Element neighbourhoods in twofold triple systems , 1987 .

[3] Lars Døvling Andersen,et al. Embedding Partial Steiner Triple Systems , 1980 .

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

[5] Joel Spencer,et al. Maximal consistent families of triples , 1968 .

[6] Charles J. Colbourn,et al. Completing small partial triple systems , 1983, Discret. Math..

[7] G. Prins,et al. Every generalized Petersen graph has a Tait coloring. , 1972 .

[8] James E. Simpson,et al. Langford sequences: perfect and hooked , 1983, Discret. Math..

[9] Jiří Novák,et al. Edge Bases of Complete Uniform Hypergraphs , 1974 .

[10] M. Colbourn,et al. On Cyclic Steiner 2-Designs , 1980 .