When we study the structure of a graph, we encounter parameters that are local (such as the clique number) and parameters that are global (such as the chromatic number). Topology provides tools to measure global phenomena. I will explain the hidden topology of the global structure of graphs for problems such as chromatic numbers, covering and matching problems, and partitions into independent sets with various constraints.