Algorithmic aspects of the generalized clique-transversal problem on chordal graphs

Discrete Applied Mathematics

Volumn 66, Issue 3, 1996, Pages 189-203

  Chang, Maw Shang ^a   Chen, Yi Hua ^a   Chang, Gerard J ^b   Yan, Jing Ho ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Chordal graph; Clique transversal set; Domination; Dual; k Tree; Neighborhood number; Split graph; Strongly chordal graph; Undirected path graph

Indexed keywords

EID: 0004711273     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00048-V     Document Type: Article

References (38)

1. T. Andreae, M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Math. 88 (1991) 11-20.
2. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
3. A.A. Bertossi, Dominating sets for split and bipartite graphs, Inform. Process. Lett. 19 (1984) 37-40.
4. K.S. Booth and J.H. Johnson, Dominating sets in chordal graphs, SIAM J. Comput. 11 (1982) 191-199.
5. G.J. Chang, M. Farber and Z. Tuza, Algorithmic aspects of neighborhood numbers, SIAM J. Disc. Math. 6 (1993) 24-29.
6. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic Discrete Methods 5 (1984) 332-345.
7. M. Conforti, D.G. Corneil and A.R. Mahjoub, k, i-Covers I: complexity and polytopes, Discrete Math. 58 (1986) 121-142.
8. D.G. Corneil and J. Fonlupt, The complexity of generalized clique covering, Discrete Appl. Math. 22 (1988/89) 109-118.
9. D.G. Corneil and J.M. Keil, A dynamic programming approach to the dominating set problem on k-trees, SIAM J. Algebraic Discrete Methods 8 (1987) 535-543.
10. P. Erdos, T. Gallai and Z. Tuza, Covering the cliques of a graph with vertices, Discrete Math., to appear.
11. M. Farber, Characterizations of strongly chordal graphs, Discrete Math. 43 (1983) 173-189.
12. S. Földes and P.L. Hammer, Split graphs, in: F. Hoffman et al., eds., Proceedings 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, Louisiana (1977) 311-315.
13. A. Frank, On chain and antichain families of a partially ordered set, J. Combin. Theory Ser. B 29 (1980) 176-184.
14. D.R. Fulkerson and O.A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
15. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, CA, 1979).
16. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput. 1 (1972) 180-187.
17. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974) 47-56.
18. F. Gavril, A recognition algorithm for the intersection graphs of directed paths in directed trees, Discrete Math. 13 (1975) 237-249.
19. F. Gavril, A recognition algorithm for the intersection graphs of paths in trees, Discrete Math. 23 (1978) 221-227.
20. F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks 17 (1987) 465-470.
21. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980.)
22. C. Greene, Some partitions associated with a partially ordered set, J. Combin. Theory Ser. A 20 (1976) 69-79.
23. C. Greene and D. Kleitman, The structure of sperner k-families, J. Combin. Theory Ser. A 20 (1976) 41-68.
24. A. Hajnal and J. Surányi, Über die Auflosüng von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest Eötvös Sect. Math, 1 (1958) 113-121.
25. S.T. Hedetniemi and R.C. Laskar, Bibliography on domination in graphs and some definitions of domination parameters, Discrete Math. 86 (1990) 257-277.
26. A.J. Hoffman, A.W.J. Kolen and M. Sakarovitch, Totally balanced and greedy matrices, SIAM J. Algebraic Discrete Methods 6 (1985) 721-730.
27. S.H. Hwang and G.J. Chang, k-Neighborhood covering and independence problems, DIMACS Report 93-03, DIMACS Center, Rutgers University (1993).
28. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computation (Plenum, New York, 1972) 85-103.
29. C.G. Lekkerkerker and J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
30. J. Lehel and Z. Tuza, Neighborhood perfect graphs, Discrete Math. 61 (1986) 93-101.
31. M.V. Marathe, R. Ravi and C. Pandu Rangan, Generalized vertex covering in interval graphs, Discrete Appl. Math. 39 (1992) 87-93.
32. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987) 973-989.
33. D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970) 597-609.
34. E. Sampathkumar and P.S. Neeralagi, The neighborhood number of a graph, Indian J. Pure Appl. Math. 16 (1985) 126-132.
35. J.P. Spinrad, Doubly lexical ordering of dense 0-1 matrices, preprint.
36. Z. Tuza, Covering all cliques of a graph, Discrete Math. 86 (1990) 117-126.
37. M. Yannakakis, Edge-deletion problems, SIAM J. Comput. 10 (1981) 297-309.
38. M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Inform. Process. Lett. 24 (1987) 133-137.