Add to ORKGWe generalize a theorem by Brown and Nowakowski on the well-covered dimension of chordal graphs. Furthermore, we prove that the well-covered dimension of any Sierpinski gasket graph of order at least 2 is equal to 3, the simplicial clique number
A graph is called well-covered if every maximal independent set has the same size. One generalizatio...
We study the basic k-covers of a bipartite graph G; the algebra A(G) they span, first studied by Her...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
AbstractGiven a graph G and field F, the well-covered vector space of G is the vector space of all f...
AbstractA graph G is a Zm-well-covered graph if |I1|≡|I2|(modm) for all maximal independent sets I1 ...
AbstractLet WC(C4^) be the set of well-covered graphs with no cycles of length 4. The main result is...
A graph G is said to be well-covered if every maximal independent set of G is of the same size. It h...
A graph is called well-covered if all of its maximal independent sets have the same cardinality. We ...
AbstractA graph is called very well-covered if it is unmixed without isolated vertices such that the...
Since it has been difficult to characterize well-dominated graphs in general, we narrow our perspect...
AbstractA graph is well-covered if every independent set can be extended to a maximum independent se...
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple f...
AbstractA graph G is well-covered if every maximal independent set has the same cardinality. This pa...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
A graph is called well-covered if every maximal independent set has the same size. One generalizatio...
We study the basic k-covers of a bipartite graph G; the algebra A(G) they span, first studied by Her...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
AbstractGiven a graph G and field F, the well-covered vector space of G is the vector space of all f...
AbstractA graph G is a Zm-well-covered graph if |I1|≡|I2|(modm) for all maximal independent sets I1 ...
AbstractLet WC(C4^) be the set of well-covered graphs with no cycles of length 4. The main result is...
A graph G is said to be well-covered if every maximal independent set of G is of the same size. It h...
A graph is called well-covered if all of its maximal independent sets have the same cardinality. We ...
AbstractA graph is called very well-covered if it is unmixed without isolated vertices such that the...
Since it has been difficult to characterize well-dominated graphs in general, we narrow our perspect...
AbstractA graph is well-covered if every independent set can be extended to a maximum independent se...
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple f...
AbstractA graph G is well-covered if every maximal independent set has the same cardinality. This pa...
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains th...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
A graph is called well-covered if every maximal independent set has the same size. One generalizatio...
We study the basic k-covers of a bipartite graph G; the algebra A(G) they span, first studied by Her...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...