Structural parameterization of minus domination
From MaRDI portal
Cites work
- Algorithmic aspect of minus domination on small-degree graphs
- Efficient minus and signed domination in graphs
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Lower bound on the minus-domination number
- Minus domination in small-degree graphs
- On complexities of minus domination
- On structural parameterizations of the bounded-degree vertex deletion problem
- On the Minus Domination Number of Graphs
- Optimization, approximation, and complexity classes
- Parameterized algorithms
- Parameterized Domination in Circle Graphs
- Roman domination in graphs.
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Some APX-completeness results for cubic graphs
- Structural parameterization of minus domination
- Structural parameterizations of dominating set variants
- The algorithmic complexity of minus domination in graphs
- Total domination in graphs
- Variations of \(Y\)-dominating functions on graphs
This page was built for publication: Structural parameterization of minus domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866659)