Let G be a group and π be a set of primes. We consider the set cd π (G) of character degrees of G that are divisible only by primes in π. In particular, we define π (G) to be the graph whose vertex set is the set of primes dividing degrees in cd π (G). There is an edge between p and q if pq divides a degree a ∈ cd π (G). We show that if G is π -solvable, then π (G) has at most two connected components.