Dominating induced matchings in graphs without a skew star (Q2447537)
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 6289275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dominating induced matchings in graphs without a skew star |
scientific article; zbMATH DE number 6289275 |
Statements
Dominating induced matchings in graphs without a skew star (English)
0 references
28 April 2014
0 references
dominating induced matching
0 references
efficient edge dominating set
0 references
polynomial-time algorithm
0 references
clique-width
0 references
0 references
0 references
0 references
0.8403680920600891
0 references
0.8355897068977356
0 references
0.8333463668823242
0 references
0.821616530418396
0 references
0.8139180541038513
0 references
