论文信息 - The strong chromatic number of partial triple systems

The strong chromatic number of partial triple systems

Abstract A strong colouring of a hypergraph is an assignment of colours to its vertices so that no two vertices in a hyperedge have the same colour. We establish that strong colouring of partial triple systems is NP-complete, even when the number of colours is any fixed k≥3. In contrast, an efficient algorithm is given for strong colouring of maximal partial triple systems. Observations in this algorithm underpin a complete determination of the spectrum of strong chromatic numbers for maximal partial triple systems.

[1] Charles J. Colbourn,et al. The Computational Complexity of Decomposing Block Designs , 1985 .

[2] Vojtech Rödl,et al. Coloring Block Designs is NP-Complete , 1982 .

[3] Martenc Jones Colbourn. Algorithmic Aspects of Combinatorial Designs: A Survey , 1985 .

[4] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[5] Vojtech Rödl,et al. Coloring Steiner Triple Systems , 1982 .

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

[7] Hanfried Lenz,et al. Design theory , 1985 .

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

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

[10] Zvi Galil,et al. NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[11] Vojtech Rödl,et al. On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems , 1984, Comb..