Semitotal domination in geometric intersection graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Algorithmic aspects of semitotal domination in graphs
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph
- Approximation schemes for covering and packing problems in image processing and VLSI
- Bounds on domination parameters in graphs: a brief survey
- Complexity and approximation ratio of semitotal domination in graphs
- Edge weighting functions on semitotal dominating sets
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On matching and semitotal domination in graphs
- On matching and total domination in graphs
- On the semitotal domination number of line graphs
- Planar Formulae and Their Uses
- Semi-total domination in unit disk graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Semitotal domination in graphs: partition and algorithmic results
- Some APX-completeness results for cubic graphs
- The semitotal domination problem in block graphs
- Total domination in graphs
- Trees with unique minimum semitotal dominating sets
- Universality considerations in VLSI circuits
This page was built for publication: Semitotal domination in geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411194)
