Studying properties of graphs through their k-vertex subsets II. notions of domination, coloring and covering

For terminology and notation in graph theory, we refer the reader to B. BOLLOBAS 12; others will be specified in the text as and when found necessary. The graphs considered in this paper, unless mentioned otherwise, are possibly infinite, simple and without loops