On an Exact Sequence Related to a Graph

The five problems of counting component colorings, vertex colorings, arc colorings, cocycles and switching equivalence classes of a graph with respect to a finite field up to isomorphism are related by an exact sequence that stems from a coboundary operator. This cohomology is presented, and counting formulas are given for each of the five problems. Finally, a topological application is given.