The complexity of generalized clique packing
- 30 November 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 12 (3) , 233-239
- https://doi.org/10.1016/0166-218x(85)90027-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the Complexity of General Graph Factor ProblemsSIAM Journal on Computing, 1983
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoileDiscrete Mathematics, 1980
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970