Equistable distance-hereditary graphs

Authors:
Ephraim Korach;Uri N. Peled;Udi Rotics
Affiliations:
Ben-Gurion University, Israel;The University of Illinois at Chicago, USA;Netanya Academic College, Israel
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 14
Cited 3

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

Information Processing Letters
Equistable graphs

Journal of Graph Theory
A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary

Information Processing Letters
Graph classes: a survey

Graph classes: a survey
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Theoretical Computer Science
Compact-port routing models and applications to distance-hereditary graphs

Journal of Parallel and Distributed Computing
Dominating Cliques in Distance-Hereditary Graphs

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Equistable series-parallel graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Equistable chordal graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Equistable graphs, general partition graphs, triangle graphs, and graph products

Discrete Applied Mathematics
On the recognition of k-equistable graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Equistable simplicial, very well-covered, and line graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

A 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 show that a necessary condition for a graph to be equistable is sufficient when the graph in question is distance-hereditary. This is used to design a polynomial-time recognition algorithm for equistable distance-hereditary graphs.