Séminaire Lotharingien de Combinatoire, B29f (1992), 7 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1993, 1993/033, p. 43-49.]

M. Hofmeister

Combinatorial Aspects of an Exact Sequence That Is Related to a Graph

Abstract. 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.

Siemens AG, München

The following version is available: