The “k-dense” subgraphs of a connected graph G are connected and contain neighbours of all but at most k-1 points. We consider necessary and sufficient conditions that a point be in Γk, the union of the minimal k-dense subgraphs. It is shown that Γk contains all the [m, k]-isthmuses” and [m, k]-articulators“— minimal subgraphs which disconnect the graph into at least k + 1 disjoint graphs—and that an [m, k]-isthmus or [m, k]-articulator of Γk disconnects G. We define “central points,” “degree” of a point, and “chromatic number” and examine the relationship of these concepts to connectivity. Many theorems contain theorems previously proved (1) as special cases.