The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680)
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: The clique-transversal set problem in claw-free graphs with degree at most 4 |
scientific article; zbMATH DE number 6378681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clique-transversal set problem in claw-free graphs with degree at most 4 |
scientific article; zbMATH DE number 6378681 |
Statements
The clique-transversal set problem in claw-free graphs with degree at most 4 (English)
0 references
9 December 2014
0 references
graph algorithms
0 references
clique
0 references
clique-transversal set problem
0 references
polynomial-time algorithm
0 references
claw-free graph
0 references
0 references
0.9385049343109132
0 references
0.9127353429794312
0 references
0.8875551223754883
0 references
0.8779883980751038
0 references
0.8666966557502747
0 references
