A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2014.02.007 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2014.02.007 / rank | |||
Normal rank |
Latest revision as of 16:39, 18 December 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
0 references