THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

[61] ISOMORPHISM OF K-CONTRACTIBLE GRAPHS - A GENERALIZATION OF BOUNDED VALENCE AND BOUNDED GENUS [J]. INFORMATION AND CONTROL, 1983, 56 (1-2): : 1 - 20

[62] MILLER GL, 1980, 12TH P ACM S THEOR C, P225

[63] ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 28 (03) : 284 - 304

[64] MONIEN B, 1981, 13TH P ANN ACM STOC, P207

[65] MONMA CL, 1985, UNPUB INTERSECTION G

[66] AN O(N2) ALGORITHM FOR COLORING PROPER CIRCULAR ARC GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (02): : 88 - 93

[67] PROSKUROWSKI A, 1982, UOCISTR825 U OR DEP

[68] DYNAMIC-PROGRAMMING ALGORITHMS FOR RECOGNIZING SMALL-BANDWIDTH GRAPHS IN POLYNOMIAL-TIME [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 363 - 369

[69] RESEARCH ALGORITHM OF STABLE POINT WITH MAXIMUM CARDINALITY IN CLAW-FREE GRAPH [J]. DISCRETE MATHEMATICS, 1980, 29 (01) : 53 - 76

[70] SCHAFFER A, 1985, COMMUNICATION

[61] ISOMORPHISM OF K-CONTRACTIBLE GRAPHS - A GENERALIZATION OF BOUNDED VALENCE AND BOUNDED GENUS [J]. INFORMATION AND CONTROL, 1983, 56 (1-2): : 1 - 20

[62] MILLER GL, 1980, 12TH P ACM S THEOR C, P225

[63] ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 28 (03) : 284 - 304

[64] MONIEN B, 1981, 13TH P ANN ACM STOC, P207

[65] MONMA CL, 1985, UNPUB INTERSECTION G

[66] AN O(N2) ALGORITHM FOR COLORING PROPER CIRCULAR ARC GRAPHS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (02): : 88 - 93

[67] PROSKUROWSKI A, 1982, UOCISTR825 U OR DEP

[68] DYNAMIC-PROGRAMMING ALGORITHMS FOR RECOGNIZING SMALL-BANDWIDTH GRAPHS IN POLYNOMIAL-TIME [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 363 - 369

[69] RESEARCH ALGORITHM OF STABLE POINT WITH MAXIMUM CARDINALITY IN CLAW-FREE GRAPH [J]. DISCRETE MATHEMATICS, 1980, 29 (01) : 53 - 76

[70] SCHAFFER A, 1985, COMMUNICATION