Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q2891369)
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: Minimal dominating sets in graph classes: combinatorial bounds and enumeration |
scientific article; zbMATH DE number 6046529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal dominating sets in graph classes: combinatorial bounds and enumeration |
scientific article; zbMATH DE number 6046529 |
Statements
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (English)
0 references
15 June 2012
0 references
0.9852311015129088
0 references
0.8867500424385071
0 references
0.8863734006881714
0 references
0.8790119886398315
0 references
0.8707166314125061
0 references
