AbstractThe 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
Two graphs are cospectral if their respective adjacency matrices have the same multi-set of eigenval...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
AbstractThe five problems of counting component colorings, vertex colorings, arc colorings, cocycles...
The automorphism group of a graph acts on its cocycle space over any field. The orbits of this group...
peer reviewedWe study the cohomology of complexes of ordinary (non- decorated) graphs, introduced by...
The problem of counting graph homomorphisms is considered. We show that the counting problem corresp...
The thesis starts out by explaining connections between graph theory, category theory and homology. ...
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfyin...
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich...
<p>We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite space...
AbstractFor a fixed graph H, the homomorphism problem for H is the problem of determining whether or...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
In this paper we observe the problem of counting graph colorings using polynomials. Several reformul...
Two graphs are cospectral if their respective adjacency matrices have the same multi-set of eigenval...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
AbstractThe five problems of counting component colorings, vertex colorings, arc colorings, cocycles...
The automorphism group of a graph acts on its cocycle space over any field. The orbits of this group...
peer reviewedWe study the cohomology of complexes of ordinary (non- decorated) graphs, introduced by...
The problem of counting graph homomorphisms is considered. We show that the counting problem corresp...
The thesis starts out by explaining connections between graph theory, category theory and homology. ...
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfyin...
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich...
<p>We generalize the idea of cofinite groups, due to B. Hartley, [2]. First we define cofinite space...
AbstractFor a fixed graph H, the homomorphism problem for H is the problem of determining whether or...
Given a simple graph G = (V, E), a subset U of V is called a clique if it induces a complete subgrap...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
In this paper we observe the problem of counting graph colorings using polynomials. Several reformul...
Two graphs are cospectral if their respective adjacency matrices have the same multi-set of eigenval...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
DOI
Add to ORKG