In a construction due to Steingrmsson, a simplicial complex is asso-ciated to each simple graph; the complex is the coloring complex of the graph. Some of the nonfaces of the coloring complex correspond in a nat-ural manner to proper colorings of the graph. Indeed, the h-vector of the complex is a certain ane transformation of the chromatic polynomial. In an earlier paper we showed that the coloring complex is constructible and hence Cohen-Macaulay. In this paper, we consider some other variants of the coloring complex corresponding to colorings that are proper for a certain number of graphs in a given sequence of graphs. Again, these com-plexes have attractive topological properties as soon as certain technical conditions are satised.
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
Thesis (Ph. D.)--University of Washington, 2007.In this thesis we consider topological aspects of gr...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...
In a recent paper, E. Steingrmsson associated to each simple graph G a simplicial complex G, referre...
AbstractThe aim of this paper is to generalize the notion of the coloring complex of a graph to hype...
AbstractGiven a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we d...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
We find families of simplicial complexes where the simplicial chromatic polynomials defined by Coope...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
AbstractAn intersection theory developed by the author for matroids embedded in uniform geometries i...
We generalize the notions of colorings, flows, and tensions of graphs to simplieial\ud complexes, an...
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simpli...
AbstractGiven a graph G (or more generally a matroid embedded in a projective space), we construct a...
Abstract. In this paper, we give a digital graph-theoretical ap-proach of the study of digital image...
Lovász's striking proof of Kneser's conjecture from 1978 using the Borsuk–Ulam theorem provides a lo...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
Thesis (Ph. D.)--University of Washington, 2007.In this thesis we consider topological aspects of gr...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...
In a recent paper, E. Steingrmsson associated to each simple graph G a simplicial complex G, referre...
AbstractThe aim of this paper is to generalize the notion of the coloring complex of a graph to hype...
AbstractGiven a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we d...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
We find families of simplicial complexes where the simplicial chromatic polynomials defined by Coope...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
AbstractAn intersection theory developed by the author for matroids embedded in uniform geometries i...
We generalize the notions of colorings, flows, and tensions of graphs to simplieial\ud complexes, an...
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simpli...
AbstractGiven a graph G (or more generally a matroid embedded in a projective space), we construct a...
Abstract. In this paper, we give a digital graph-theoretical ap-proach of the study of digital image...
Lovász's striking proof of Kneser's conjecture from 1978 using the Borsuk–Ulam theorem provides a lo...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
Thesis (Ph. D.)--University of Washington, 2007.In this thesis we consider topological aspects of gr...
summary:An interesting connection between the chromatic number of a graph $G$ and the connectivity o...