Pages that link to "Item:Q2304548"

The following pages link to Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548):

Displayed 11 items.

• Semitotal domination on AT-free graphs and circle graphs (Q831692) ‎ (← links)
• Blocking total dominating sets via edge contractions (Q2034793) ‎ (← links)
• Using edge contractions to reduce the semitotal domination number (Q2098176) ‎ (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) ‎ (← links)
• The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) ‎ (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) ‎ (← links)
• Distance Domination in Graphs (Q3384610) ‎ (← links)
• 2-OUTER-INDEPENDENT SEMITOTAL DOMINATION IN GRAPHS (Q5865382) ‎ (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) ‎ (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) ‎ (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) ‎ (← links)