An Application of Graph Coloring to Printed Circuit Testing

IEEE Transactions on Circuits and Systems

Volumn 23, Issue 10, 1976, Pages 591-599

  Garey, Michael R ^a   Johnson, David Stifler ^a   So, Hing C ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PRINTED CIRCUITS;

EID: 0017014213     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1976.1084138     Document Type: Article

References (5)

1. R. G. Busacker and T. L. Saaty, Finite Graphs and Networks. New York: McGraw-Hill, 1965.
2. M. R. Garey and D. S. Johnson, “The complexity of near-optimal graph coloring,” J. Assoc. Comput. Mack, vol. 23, pp. 43-49, 1976.
3. F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
4. D. S. Johnson, “Worst case behavior of graph coloring algorithms,” in Proc. Fifth Southeastern Conf. on Combinatorics, Graph Theory, and Computing. Winnipeg, Manitoba: Utilitas Mathematica Publishing, 1974, pp. 513-528.
5. D. M. Matula, G. Marble, and J. D. Isaacson, “Graph Coloring Algorithms,” in Graph Theory and Computing, R. C. Read, Ed. New York, Academic Press, 1972, pp. 109-122.