Pages that link to "Item:Q423952"
From MaRDI portal
The following pages link to On graphs for which the connected domination number is at most the total domination number (Q423952):
Displaying 15 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)
- On the existence of total dominating subgraphs with a prescribed additive hereditary property (Q641172) (← links)
- Extremal connected graphs for independent domination number (Q1420609) (← 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)
- Relating the size of a connected graph to its total and restricted domination numbers (Q1827789) (← 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)
- The structure of dominating subgraphs (Q2926620) (← links)
- Connected Domination (Q3384607) (← links)
- (Q4304592) (← links)
- [1,2]-Complementary connected domination number of graphs-III (Q5084547) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)