The following pages link to (Q2878209):
Displaying 27 items.
- Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs (Q510554) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Vertices contained in all or in no minimum semitotal dominating set of a tree (Q907832) (← links)
- On the semitotal domination number of line graphs (Q1720344) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- A Vizing-type result for semi-total domination (Q1732092) (← links)
- Edge weighting functions on semitotal dominating sets (Q2014223) (← links)
- Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- The semitotal domination problem in block graphs (Q2062683) (← links)
- Semitotal domination of Harary graphs (Q2081164) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- On the semitotal forcing number of a graph (Q2134991) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Trees with unique minimum semitotal dominating sets (Q2175800) (← links)
- From the strong differential to Italian domination in graphs (Q2238746) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Semipaired domination in maximal outerplanar graphs (Q2331595) (← links)
- Semipaired domination in claw-free cubic graphs (Q2413648) (← links)
- Graphs with large semipaired domination number (Q2416951) (← links)
- On matching and semitotal domination in graphs (Q2440939) (← links)
- Complexity and approximation ratio of semitotal domination in graphs (Q4583541) (← links)
- (Q5038382) (← links)
- Semitotal domination number of some graph operations (Q6064552) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)