Equistable distance-hereditary graphs
From MaRDI portal
Publication:2473043
DOI10.1016/j.dam.2006.06.018zbMath1138.05062OpenAlexW2013992464MaRDI QIDQ2473043
Ephraim Korach, Udi Rotics, Uri N. Peled
Publication date: 26 February 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.06.018
Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Equistarable bipartite graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs ⋮ Complexity results for equistable graphs and related classes ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ Short proofs on the structure of general partition, equistable and triangle graphs ⋮ Equistable graphs, general partition graphs, triangle graphs, and graph products ⋮ Recognizing k-equistable Graphs in FPT Time ⋮ Decomposing 1-Sperner hypergraphs ⋮ Strong cliques and equistability of EPT graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Completely separable graphs
- Distance-hereditary graphs
- Graph classes between parity and distance-hereditary graphs
- Equistable series-parallel graphs
- Equistable chordal graphs
- Threshold graphs and related topics
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Topology of series-parallel networks
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Graph Classes: A Survey
- Equistable graphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Dominating cliques in distance-hereditary graphs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- Compact-port routing models and applications to distance-hereditary graphs
This page was built for publication: Equistable distance-hereditary graphs