Clique transversal and clique independence on comparability graphs

Information Processing Letters

Volumn 58, Issue 4, 1996, Pages 181-184

  Balachandran, V ^a   Nagavamsi, P ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Algorithms; Clique independence; Clique transversal

Indexed keywords

EID: 0141669232     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00054-3     Document Type: Article

References (11)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. T. Andreae, M. Schughart and Zs. Tuza, Clique transversal sets of line graphs and complements of line graphs, Discrete Math. 88 (1991) 11-20.
3. J.A. Bondy and U.S.R. Murthy, Graph Theory with Applications North-Holland, New York, 1976).
4. G.J. Chang, M. Farber and Zs. Tuza, Algorithmic aspects of neighbourhood numbers, SIAM J. Discrete Math. 6 (1993) 24-29.
5. S. Even, Graph Algorithms (Computer Science Press, Rockville, MD, 1979).
6. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
7. C.L. Liu, Elements of Discrete Mathematics (McGraw-Hill, New York, 1985).
8. K. Menger, Zur allgemeinen Kurventheorie, Fund. Math. 10 (1927) 96-115.
9. Redei, Ein kombinatorischer Satz, Acta Sci. Math. 7 (1934) 39-43.
10. 2) time, in: Proc. 15th Ann. ACM Symp. on Theory of Computing (1983) 457-466.
11. Zs. Tuza, Covering all cliques of a graph, Discrete Math. 86 (1990) 117-126.