Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs |
scientific article; zbMATH DE number 3741447
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs |
scientific article; zbMATH DE number 3741447 |
Statements
Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (English)
0 references
1981
0 references
clique cover
0 references
0 references
