Pages that link to "Item:Q423952"

The following pages link to On graphs for which the connected domination number is at most the total domination number (Q423952):

Displaying 9 items.

• The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
• On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
• Domination parameters of a graph and its complement (Q1692643) (← links)
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
• Connected domination in maximal outerplanar graphs (Q2192107) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Bounds on the connected domination number of a graph (Q2446883) (← links)
• Connected Domination (Q3384607) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)