A new characterization of \(P_k\)-free graphs (Q300476)
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 6599029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new characterization of \(P_k\)-free graphs |
scientific article; zbMATH DE number 6599029 |
Statements
A new characterization of \(P_k\)-free graphs (English)
0 references
28 June 2016
0 references
\(P_k\)-free graph
0 references
connected domination
0 references
computational complexity
0 references
0.972766637802124
0 references
0.8738345503807068
0 references
0.8730112910270691
0 references
0.7884727120399475
0 references
0.7773023843765259
0 references
