| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651157 | Discrete Mathematics | 2007 | 6 Pages |
Abstract
A graph G is hereditarily dominated by a class of connected graphs DD if each connected induced subgraph of G contains a dominating induced subgraph belonging to DD. In this paper, we determine graphs hereditarily dominated by classes of cycles and paths, paths, trees and trees with a bounded diameter. In each case, a characterization in terms of forbidden induced subgraphs is given.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Danuta Michalak,