Independence and Efficient Domination on <i>P</i> <sub>6</sub> -free Graphs (Q4554948)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6976503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independence and Efficient Domination on <i>P</i> <sub>6</sub> -free Graphs |
scientific article; zbMATH DE number 6976503 |
Statements
Independence and Efficient Domination on <i>P</i> <sub>6</sub> -free Graphs (English)
0 references
12 November 2018
0 references
(quasi)polynomial-time algorithms
0 references
\(P_6\)-free graphs
0 references
independence
0 references
efficient domination
0 references
1.0000001
0 references
0.95040286
0 references
0.9313993
0 references
0 references
0.9129084
0 references
0.90704244
0 references
0 references
0.8994166
0 references
