A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593)
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 6286632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on efficient domination in a superclass of \(P_5\)-free graphs |
scientific article; zbMATH DE number 6286632 |
Statements
A note on efficient domination in a superclass of \(P_5\)-free graphs (English)
0 references
17 April 2014
0 references
combinatorial problems
0 references
domination in graphs
0 references
efficient domination
0 references
perfect code
0 references
0 references
0.9181049
0 references
0.90699714
0 references
0.8976739
0 references
0.89635015
0 references
0.8922739
0 references
0.88770336
0 references
0.8852557
0 references
0.8802893
0 references
