On an exact sequence related to a graph (Q1922871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 930068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an exact sequence related to a graph |
scientific article; zbMATH DE number 930068 |
Statements
On an exact sequence related to a graph (English)
0 references
23 March 1997
0 references
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.
0 references
colorings
0 references
exact sequence
0 references
cohomology
0 references
0.9405562
0 references
0 references
0 references
0.9046308
0 references
0 references
0.89946365
0 references
0.89618945
0 references
0 references
