Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs
- 31 December 1981
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 37 (2-3) , 181-191
- https://doi.org/10.1016/0012-365x(81)90218-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- 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
- The strong perfect-graph conjecture is true for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973