Domination problems in nowhere-dense classes of graphs (Q2920123)
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: Domination problems in nowhere-dense classes of graphs |
scientific article; zbMATH DE number 6098224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Domination problems in nowhere-dense classes of graphs |
scientific article; zbMATH DE number 6098224 |
Statements
24 October 2012
0 references
dominating set
0 references
distance-\(d\) dominating set
0 references
nowhere-dense graph classes
0 references
\(H\)-minor free graphs
0 references
fixed-parameter tractablility
0 references
Domination problems in nowhere-dense classes of graphs (English)
0 references
0.8594904541969299
0 references
0.8584854602813721
0 references
0.8482369780540466
0 references
0.8165665864944458
0 references
0.8155433535575867
0 references
