Weighted efficient domination problem on some perfect graphs
From MaRDI portal
(Redirected from Publication:1348388)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4063153 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 637526 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1156661 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Bipartite permutation graphs
- Completely separable graphs
- Distance regular subgraphs of a cube
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Distance-hereditary graphs
- Dominating cliques in distance-hereditary graphs
- Dominating sets in n‐cubes
- Graph Classes: A Survey
- Perfect codes in graphs
- Perfect codes in the graphs \(O_k\)
- Planar 3DM is NP-complete
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- The weighted perfect domination problem
- The weighted perfect domination problem and its variants
- Weighted domination of cocomparability graphs
- Weighted independent perfect domination on cocomparability graphs
Cited in
(37)- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- Exact algorithms for dominating induced matching based on graph partition
- Efficient domination in grid graphs
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient minus and signed domination in graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Efficient domination for classes of \(P_6\)-free graphs
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs
- On weighted efficient total domination
- Bi-efficient domination in graphs
- The weighted perfect domination problem and its variants
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- On efficient dominating sets in simplicial graphs
- A Taxonomy of Perfect Domination
- Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
- Cost effective domination in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Acyclic domination on bipartite permutation graphs
- \(k\)-efficient partitions of graphs
- k-Efficient domination: Algorithmic perspective
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- Hereditary efficiently dominatable graphs
- Efficient and perfect domination on circular-arc graphs
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Weighted domination in triangle-free graphs
- Semi square stable graphs and efficient dominating sets
- On efficient domination for some classes of \(H\)-free bipartite graphs
- Structure of squares and efficient domination in graph classes
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
- Perfect domination and small cycles
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
- On \([j, k]\)-sets in graphs
- Efficient (j,k)-domination
This page was built for publication: Weighted efficient domination problem on some perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348388)
