Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055)
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: Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs |
scientific article |
Statements
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (English)
0 references
26 October 2018
0 references
weighted efficient domination
0 references
modular decomposition
0 references
\(H\)-free graphs
0 references
linear forest
0 references
\((H_1, H_2)\)-free graphs
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
