SMALLEST-LAST ORDERING AND CLUSTERING AND GRAPH-COLORING ALGORITHMS

[1] [Anonymous], 1968, J COMBIN THEORY

[2] NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (04) : 251 - 256

[3] A BOUND GIVEN BY HS WILF FOR FINITE GRAPH CHROMATIC NUMBERS [J]. MATHEMATISCHE NACHRICHTEN, 1969, 39 (4-6) : 373 - &

[4] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49

[5] APPLICATION OF GRAPH COLORING TO PRINTED-CIRCUIT TESTING [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1976, 23 (10): : 591 - 599

[6] COLORING RANDOM GRAPHS [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1975, 77 (MAR) : 313 - 324

[7] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[8] Jardine N., 1971, MATH TAXONOMY

[9] Karp R.M., 1972, COMPLEXITY COMPUTER

[10] KARP RM, 1975, 6TH P SE C COMB GRAP, P15

[1] [Anonymous], 1968, J COMBIN THEORY

[2] NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (04) : 251 - 256

[3] A BOUND GIVEN BY HS WILF FOR FINITE GRAPH CHROMATIC NUMBERS [J]. MATHEMATISCHE NACHRICHTEN, 1969, 39 (4-6) : 373 - &

[4] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49

[5] APPLICATION OF GRAPH COLORING TO PRINTED-CIRCUIT TESTING [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1976, 23 (10): : 591 - 599

[6] COLORING RANDOM GRAPHS [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1975, 77 (MAR) : 313 - 324

[7] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[8] Jardine N., 1971, MATH TAXONOMY

[9] Karp R.M., 1972, COMPLEXITY COMPUTER

[10] KARP RM, 1975, 6TH P SE C COMB GRAP, P15