Pages that link to "Item:Q1731849"

The following pages link to Algorithmic aspects of semitotal domination in graphs (Q1731849):

Displaying 28 items.

• Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
• Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
• Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
• Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← 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)
• 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)
• Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
• Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
• Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
• Semipaired Domination in Some Subclasses of Chordal Graphs (Q5038198) (← links)
• (Q5038382) (← links)
• Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
• 2-OUTER-INDEPENDENT SEMITOTAL DOMINATION IN GRAPHS (Q5865382) (← links)
• Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
• Semitotal domination number of some graph operations (Q6064552) (← links)
• Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs (Q6114823) (← links)
• (Q6155858) (← links)
• Semi-total domination in unit disk graphs (Q6547828) (← links)
• A characterization of graphs with semitotal domination number one-third their order (Q6580490) (← links)
• The \(k\) edge-vertex domination problem (Q6591483) (← links)
• Algorithmic aspects of total vertex-edge domination in graphs (Q6629669) (← links)
• Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)
• Edge weighting functions on the semitotal dominating set of claw-free graphs (Q6666559) (← links)