### TABLE 1. Complexity results for ten famous graph problems when restricted to the classes of graphs discussed in the text. The ten problems are INDEPENDENT SET, CLIQUE, PARTITION INTO CLIQUES, CHROMATIC NUMBER, CHROMATIC INDEX, HAMILTONIAN CIRCUIT, DOMINATING SET, SIMPLE (unweighted) MAX CUT, (unweighted) STEINER TREE IN GRAPHS, and GRAPH ISOMORPHISM. The first nine are known to be NP-complete for general graphs; the complexity of GRAPH ISOMORPHISM for general graphs is a long-standing open problem. The well-known VERTEX COVER problem is not included as its complexity will always be the same as that of INDEPENDENT SET; see [G amp;J, p.54]. The second column gives the com- plexity of determining membership in the given class (and constructing the associated model where appropriate, as in the case of intersection graphs). For a key to the abbreviations used as entries in the table, see the continuation of the table on the next page.

1985

Cited by 159

### Table 16: Numbers of reported long-standing illnesses in the SheS, and the numbers of those reported to be limiting.

"... In PAGE 32: ...6 illnesses per person) of which 3,217 were regarded as limiting. Table16 shows the diseases that account for the largest numbers of reported LIs, and for each of them the numbers that are reported as limiting19. Men sufiered most from heart problems, hypertension, asthma, arthritis, back problems and problems of the bones, muscles and joints.... ..."