Domination in distance-hereditary graphs
From MaRDI portal
Publication:5957300
DOI10.1016/S0166-218X(00)00330-9zbMath0991.05077MaRDI QIDQ5957300
Hong-Gwa Yeh, Gerard Jennhwa Chang, Shaur-Ching Wu, Maw-Shang Chang
Publication date: 24 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ Simple linear-time algorithms for counting independent sets in distance-hereditary graphs ⋮ A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs ⋮ Paired-domination problem on distance-hereditary graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ An efficient algorithm for distance total domination in block graphs ⋮ Laminar structure of ptolemaic graphs with applications ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs ⋮ Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total domination and transformation
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Completely separable graphs
- Distance-hereditary graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- A linear algorithm for the domination number of a tree
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs
- On the Algorithmic Complexity of Total Domination
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Edge Dominating Sets in Graphs
- R -Domination in Graphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- The edge domination problem
- Dominating cliques in distance-hereditary graphs
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
This page was built for publication: Domination in distance-hereditary graphs
