Séminaire Lotharingien de Combinatoire, B29f (1992), 7
[Formerly: Publ. I.R.M.A. Strasbourg, 1993, 1993/033, p.
Combinatorial Aspects of an Exact Sequence
That Is 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.
Siemens AG, München
The following version is available: