scientific article; zbMATH DE number 91051
From MaRDI portal
Publication:4017197
Recommendations
Cited in
(56)- Blockbusting and domineering
- Dominating sets in perfect graphs
- Topics on domination
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Regular codes in regular graphs are difficult
- Weighted efficient domination problem on some perfect graphs
- Weighted domination of cocomparability graphs
- Efficient minus and signed domination in graphs
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- The many facets of upper domination
- Fair domination number in cactus graphs
- Domination cover rubbling
- Domination problems with no conflicts
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Perfect graphs of strong domination and independent strong domination
- Efficient domination for classes of \(P_6\)-free graphs
- Modelling and solving the perfect edge domination problem
- A note on the fair domination number in outerplanar graphs
- A characterization of perfect Roman trees
- Perfect Italian domination on planar and regular graphs
- Fair total domination number in cactus graphs
- When an optimal dominating set with given constraints exists
- A generalization of Lee codes
- Generalized perfect domination in graphs
- \([1,2]\)-sets in graphs
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- scientific article; zbMATH DE number 4204394 (Why is no real title available?)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- An induced subgraph characterization of domination perfect graphs
- On perfect and quasiperfect dominations in graphs
- Rainbow perfect domination in lattice graphs
- Equitable fair domination in graphs
- A Taxonomy of Perfect Domination
- On the perfect differential of a graph
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- scientific article; zbMATH DE number 7107005 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- Hereditary efficiently dominatable graphs
- Perfect domination and small cycles
- Outer complete fair domination in graphs
- Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
- Parameterized complexity of minimum membership dominating set
- Graphs whose vertices of degree at least 2 lie in a triangle
- Minimum-membership geometric dominating set: complexity and algorithms
- A study on perfect Italian domination of graphs and their complements
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
- Locating fair domination in graphs
- On the complexity of minimum membership dominating set
- A study on the weighted efficient domination problem for C₄-free bipartite graphs
- New characterization of efficient closed and open dominated graphs
- Algorithms for unipolar and generalized split graphs
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- Weighted efficient domination in two subclasses of P₆-free graphs
- Dominance made simple
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017197)
