scientific article
From MaRDI portal
Publication:2878209
zbMath1300.05220MaRDI QIDQ2878209
Michael A. Henning, Wayne Goddard, Charles A. McPillan
Publication date: 28 August 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Semitotal domination subdivision numbers of graphs ⋮ A new approach on locally checkable problems ⋮ ISOLATE SEMITOTAL DOMINATION IN GRAPHS ⋮ Semitotal domination on AT-free graphs and circle graphs ⋮ On the semitotal forcing number of a graph ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Trees with unique minimum semitotal dominating sets ⋮ Semipaired domination in claw-free cubic graphs ⋮ Graphs with large semipaired domination number ⋮ Semitotal domination number of some graph operations ⋮ A linear-time algorithm for semitotal domination in strongly chordal graphs ⋮ INDEPENDENT SEMITOTAL DOMINATION IN THE CORONA OF GRAPHS ⋮ INDEPENDENT SEMITOTAL DOMINATION IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS ⋮ Vertices contained in all or in no minimum semitotal dominating set of a tree ⋮ On matching and semitotal domination in graphs ⋮ On the semitotal domination number of line graphs ⋮ Semitotal domination in claw-free cubic graphs ⋮ Algorithmic aspects of semitotal domination in graphs ⋮ A Vizing-type result for semi-total domination ⋮ Unnamed Item ⋮ From the strong differential to Italian domination in graphs ⋮ Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs ⋮ Semitotal domination in claw-free cubic graphs ⋮ Edge weighting functions on semitotal dominating sets ⋮ Complexity and approximation ratio of semitotal domination in graphs ⋮ Bounds on the semipaired domination number of graphs with minimum degree at least two ⋮ Perfect graphs involving semitotal and semipaired domination ⋮ An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ The semitotal domination problem in block graphs ⋮ Semitotal domination of Harary graphs ⋮ Semipaired domination in maximal outerplanar graphs ⋮ Using edge contractions to reduce the semitotal domination number ⋮ 2-OUTER-INDEPENDENT SEMITOTAL DOMINATION IN GRAPHS
This page was built for publication: