Algorithmic aspects of clique-transversal and clique-independent sets

Discrete Applied Mathematics

Volumn 100, Issue 3, 2000, Pages 183-202

  Guruswami, Venkatesan ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Clique independent set; Clique transversal set; Graph algorithm; Line graph; NP hardness; Poset; Total graph

Indexed keywords

EID: 0141446307     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00159-6     Document Type: Article

References (23)

1. Andreae T., Schughart M., Tuza Zs. Clique-transversal sets of line graphs and complements of line graphs. Discrete Math. 88:1991;11-20.
2. Balachandhran V., Nagavamsi P., Pandu Rangan C. Clique transversal and clique independence on comparability graphs. Inform. Process. Lett. 58:1996;181-184.
3. Booth K.S., Lueker G.S. Testing for the consecutive ones property, interval graphs and graph planarity using P-Q tree algorithms. J. Comput. System Sci. 13:1976;335-379.
4. Chang M.S., Chen Y.H., Chang G.J., Yan J.H. Algorithmic aspects of the genralized clique-transversal problem on chordal graphs. Discrete Appl. Math. 66:1996;189-203.
5. Chang G.J., Farber M., Tuza Z. Algorithmic aspects of neighbourhood numbers. SIAM J. Discrete Math. 6:1993;24-29.
6. Chang G.J., Nemhauser G.L. The. k -domination and k -stability problems on sun-free chordal graphs SIAM J. Algebraic Discrete Methods. 5:1984;332-345.
7. Corneil D.G., Fonlupt J. The complexity of generalized clique covering. Discrete Appl. Math. 22:1988; / 1989 109-118.
8. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
9. Duffus D., Kierstead H.A., Trotter W.T. Fibres and ordered set coloring. J. Combin. Theory Ser. A. 58:1991;158-164.
10. Farber M. Characterizations of strongly chordal graphs. Discrete Math. 43:1983;173-189.
11. Farber M. Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7:1984;115-130.
12. Gavril F. Algorithms on circular-arc graphs. Networks. 4:1974;357-369.
13. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
14. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
15. Hoffman A.J., Kolen A.W.J., Sakarovitch M. Totally-balanced and greedy matrices. SIAM J. Algebraic Discrete Methods. 6:1985;721-730.
16. Horton J.D., Kilakos K. Minimum edge dominating sets. SIAM J. Discrete Math. 6:1993;375-387.
17. Lehel J., Tuza Zs. Neighbourhood perfect graphs. Discrete Math. 61:1986;93-101.
18. Lonc Z., Rival I. Chains, antichains and fibres. J. Combin. Theory Ser. A. 44:1987;207-228.
19. Ramalingam G., Pandu Rangan C. A unified approach to domination problems on interval graphs. Inform. Process. Lett. 27:1988;271-274.
20. Tuza Zs. Covering all cliques of a graph. Discrete Math. 86:1990;117-126.
21. Yannakakis M., Gavril F. Edge dominating sets in graphs. SIAM J. Appl. Math. 38:1980;364-372.
22. Yannakakis M., Gavril F. The maximum. k -colorable subgraph problem for chordal graphs Inform. Process. Lett. 24:1987;133-137.
23. Yannakakis M. Edge-deletion problems. SIAM J. Comput. 10:1981;297-309.