| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648351 | Discrete Mathematics | 2009 | 8 Pages |
Abstract
We prove several structural and hardness results concerning pairs of disjoint sets in graphs which are dominating or independent and dominating.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael A. Henning, Christian Löwenstein, Dieter Rautenbach,