A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025534681 / rank | |||
Normal rank | |||
Revision as of 22:01, 19 March 2024
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
