Nearly perfect sets in the n-fold products of graphs
The study of nearly perfect sets in graphs was initiated in [J. E. Dunbar, F. C. Harris, S. M. Hedetniemi, S. T. Hedetniemi, A. A. McRae, R. C. Laskar, Nearly perfect sets in graphs, Discrete Mathematics 138 (1995), 229-246]. Let \(S \subseteq V(G)\). We say that \(S\) is a nearly perfect set (or is...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2007-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol27/1/art/opuscula_math_2708.pdf |