On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On efficient domination for some classes of \(H\)-free bipartite graphs |
scientific article |
Statements
On efficient domination for some classes of \(H\)-free bipartite graphs (English)
0 references
6 November 2019
0 references
weighted efficient domination
0 references
\(H\)-free bipartite graphs
0 references
NP-completeness
0 references
polynomial time algorithm
0 references
clique-width
0 references
0 references
0 references
0 references
