Pages that link to "Item:Q423975"

The following pages link to A note on connected dominating sets of distance-hereditary graphs (Q423975):

Displaying 6 items.

• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible (Q2283214) (← links)
• On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)