Results 1 to 10 of about 40 (25)
Complexity results for equistable graphs and related classes [PDF]
Annals of Operations Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Orlin +2 more
exaly +4 more sources
Equistable distance-hereditary graphs
Discrete Applied Mathematics, 2008 A graph is equistable if a non-negative function on its vertices exists such that a set \(S\) of vertices has total weight 1 if and only if \(S\) is maximal stable. This concept was introduced by \textit{N. V. R. Mahadev, U. N. Peled} and \textit{F. Sun} [J.\ Graph Theory 18, 281--299 (1994; Zbl 0794.05112)].
Udi Rotics, Uri N Peled
exaly +3 more sources
Recognizing k-equistable Graphs in FPT Time [PDF]
Lecture Notes in Computer Science, 2016 A graph $G = (V,E)$ is called equistable if there exist a positive integer $t$ and a weight function $w : V \to \mathbb{N}$ such that $S \subseteq V$ is a maximal stable set of $G$ if and only if $w(S) = t$. Such a function $w$ is called an equistable function of $G$.
Oliver Schaudt +2 more
exaly +3 more sources
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N Peled
exaly +2 more sources
On equistable, split, CIS, and related classes of graphs
Discrete Applied Mathematics, 2017 We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic study of the relations between them. As part of this study, we introduce two generalizations of CIS graphs, obtain a new characterization of split graphs, and a ...
Endre Boros, Martin Milanič
exaly +3 more sources
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefko Miklavic, Martin Milanič
exaly +2 more sources
Equistable series–parallel graphs
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N Peled
exaly +3 more sources
A class of threshold and domishold graphs: equistable and equidominating graphs
Discrete Mathematics, 1980 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Payan
exaly +2 more sources
On the Recognition of k-Equistable Graphs
Lecture Notes in Computer Science, 2012 A graph G=(V,E) is called equistable if there exist a positive integer t and a weight function $w:V \longrightarrow \mathbb{N}$ such that S⊆V is a maximal stable set of G if and only if w(S)=t. The function w, if exists, is called an equistable function of G.
Vadim Levit +2 more
exaly +3 more sources
Equistable simplicial, very well-covered, and line graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vadim Levit, Martin Milanič
exaly +2 more sources