The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543)
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,Kâ\-free planar graphs |
scientific article; zbMATH DE number 6655349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs |
scientific article; zbMATH DE number 6655349 |
Statements
The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (English)
0 references
23 November 2016
0 references
algorithms
0 references
graph algorithms
0 references
combinatorial problems
0 references
0 references
0.9385049343109132
0 references
0.8813130259513855
0 references
0.881075918674469
0 references
0.8615138530731201
0 references
