Highly Influenced

- Published 1990 in Discrete Mathematics
DOI:10.1016/0012-365X(90)90344-H

The classical problems of covering chessboards with the minimum number of chess pieces were important in motivating the revival of the study of dominating sets in graphs, which commenced in the early 1970’s. These problems certainly date back to de Jaenisch [7] and have been mentioned in the literature frequently since that time (see e.g. [2,8,13]). A graph… CONTINUE READING

### Presentations referencing similar topics