On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841)
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 7206528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On efficient domination for some classes of \(H\)-free chordal graphs |
scientific article; zbMATH DE number 7206528 |
Statements
On efficient domination for some classes of \(H\)-free chordal graphs (English)
0 references
29 May 2020
0 references
weighted efficient domination
0 references
\(H\)-free chordal graphs
0 references
NP-completeness
0 references
net-free chordal graphs
0 references
extended-gem-free chordal graphs
0 references
\( S_{1
0 references
2
0 references
3}\)-free chordal graphs
0 references
polynomial time algorithm
0 references
clique-width
0 references
0 references
0 references
0 references
0.9579682350158693
0 references
0.9049376249313354
0 references
0.9035710096359252
0 references
0.8990871906280518
0 references
0.8978805541992188
0 references
