APPLICATION OF GRAPH COLORING TO PRINTED-CIRCUIT TESTING

[1] Busacker R.G., 1965, FINITE GRAPHS NETWOR

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

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

[4] JOHNSON DS, 1974, 5TH P SE C COMB GRAP, P513

[5] Matula DW, 1972, GRAPH THEORY COMPUTI, P109, DOI DOI 10.1016/B978-1-4832-3187-7.50015-5

[1] Busacker R.G., 1965, FINITE GRAPHS NETWOR

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

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

[4] JOHNSON DS, 1974, 5TH P SE C COMB GRAP, P513

[5] Matula DW, 1972, GRAPH THEORY COMPUTI, P109, DOI DOI 10.1016/B978-1-4832-3187-7.50015-5