A note on connected dominating sets of distance-hereditary graphs

DOI10.1016/j.dam.2012.02.003zbMath1239.05142OpenAlexW1997062413MaRDI QIDQ423975

Oliver Schaudt

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.003

zbMATH Keywords

distance-hereditary graphsconnected dominating setsstructural domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs, On dominating sets whose induced subgraphs have a bounded diameter, Linear separation of connected dominating sets in graphs

Cites Work

• Well paired-dominated graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Distance-hereditary graphs
• Locally well-dominated and locally independent well-dominated graphs
• Dominating and large induced trees in regular graphs
• Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Graph Classes: A Survey
• 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
• Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item