The complexity of generalized clique covering
- 1 January 1988
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 22 (2), 109-118
- https://doi.org/10.1016/0166-218x(88)90086-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Ki-covers. II.Ki-perfect graphsJournal of Graph Theory, 1987
- A Dynamic Programming Approach to the Dominating Set Problem on k-TreesSIAM Journal on Algebraic Discrete Methods, 1987
- The maximum k-colorable subgraph problem for chordal graphsInformation Processing Letters, 1987
- Ki-covers I: Complexity and polytopesDiscrete Mathematics, 1986
- The complexity of generalized clique packingDiscrete Applied Mathematics, 1985
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981
- Algorithms on clique separable graphsDiscrete Mathematics, 1977
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970