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 this page instead for the normal view: A note on efficient domination in a superclass of \(P_5\)-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on efficient domination in a superclass of \(P_5\)-free graphs |
scientific article |
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
