AbstractA graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series–parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable outer-planar graphs
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-inters...
We show that the eigenpolytopes of graphs are universal in the sense that every polytope, up to affi...
AbstractLet G be a simple graph with n⩾3 vertices and orientable genus g and non-orientable genus h....
AbstractA graph is called equistable when there is a non-negative weight function on its vertices su...
Abstract. A graph is called equistable when there is a non-negative weight function on its vertices ...
AbstractA graph is called equistable when there is a non-negative weight function on its vertices su...
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices i...
AbstractA threshold graph (respectively domishold graph) is a graph for which the independent sets (...
AbstractIn this paper we examine the connections between equistable graphs, general partition graphs...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractIf G is a planar graph of smallest order such that the stability number of G is less than on...
AbstractThose nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle bas...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractThe minimum weight feedback vertex set problem (FVS) on series–parallel graphs can be solved...
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-inters...
We show that the eigenpolytopes of graphs are universal in the sense that every polytope, up to affi...
AbstractLet G be a simple graph with n⩾3 vertices and orientable genus g and non-orientable genus h....
AbstractA graph is called equistable when there is a non-negative weight function on its vertices su...
Abstract. A graph is called equistable when there is a non-negative weight function on its vertices ...
AbstractA graph is called equistable when there is a non-negative weight function on its vertices su...
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices i...
AbstractA threshold graph (respectively domishold graph) is a graph for which the independent sets (...
AbstractIn this paper we examine the connections between equistable graphs, general partition graphs...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractIf G is a planar graph of smallest order such that the stability number of G is less than on...
AbstractThose nonseparable graphs whose induced cycles form a (necessarily minimum length) cycle bas...
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counter...
AbstractThe minimum weight feedback vertex set problem (FVS) on series–parallel graphs can be solved...
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-inters...
We show that the eigenpolytopes of graphs are universal in the sense that every polytope, up to affi...
AbstractLet G be a simple graph with n⩾3 vertices and orientable genus g and non-orientable genus h....
DOI
Add to ORKG