Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Authors:
- Chang Maw-ShangCMChang Maw-Shang
- Chen Yi-HuaCYChen Yi-Hua
- Gerard J. ChangGCGerard J. Chang
- Yan Jing-HoYJYan Jing-Ho
- 1 May 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 66 (3) , 189-203
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Algorithmic Aspects of Neighborhood NumbersSIAM Journal on Discrete Mathematics, 1993
- Covering the cliques of a graph with verticesDiscrete Mathematics, 1992
- Clique-transversal sets of line graphs and complements of line graphsDiscrete Mathematics, 1991
- The complexity of generalized clique coveringDiscrete Applied Mathematics, 1988
- A Dynamic Programming Approach to the Dominating Set Problem on k-TreesSIAM Journal on Algebraic Discrete Methods, 1987
- K-covers I: Complexity and polytopesDiscrete Mathematics, 1986
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Dominating sets for split and bipartite graphsInformation Processing Letters, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982