A note on connected dominating sets of distance-hereditary graphs
From MaRDI portal
Publication:423975
DOI10.1016/J.DAM.2012.02.003zbMATH Open1239.05142OpenAlexW1997062413MaRDI QIDQ423975FDOQ423975
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Graph Classes: A Survey
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Distance-hereditary graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Dominating cliques in distance-hereditary graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete description of forbidden subgraphs in the structural domination problem
- 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
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Title not available (Why is that?)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- Well paired-dominated graphs
Cited In (6)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Linear separation of connected dominating sets in graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- On dominating sets whose induced subgraphs have a bounded diameter
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
This page was built for publication: A note on connected dominating sets of distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423975)
