The multiple domination and limited packing problems in graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Limited packing and multiple domination problems: polynomial time reductions
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Polynomial reductions between the limited packing and tuple domination problems in graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
Cites work
- \(k\)-tuple domination in graphs
- A New Class of Brittle Graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Algorithmic aspect of k-tuple domination in graphs.
- Balanced matrices
- Characterizations of totally balanced matrices
- Domination, independent domination, and duality in strongly chordal graphs
- Doubly Lexical Orderings of Matrices
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- Limited packings in graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- Recognizing P₄ -Sparse Graphs in Linear Time
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Totally-Balanced and Greedy Matrices
- Weakly triangulated graphs
Cited in
(22)- A polyhedral view to generalized multiple domination and limited packing
- Labelled packing functions in graphs
- Tuple domination on graphs with the consecutive-zeros property
- The probabilistic approach to limited packings in graphs
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
- Polynomial reductions between the limited packing and tuple domination problems in graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- On the complexity of the {\(k\)}-packing function problem
- On the complexity of the labeled domination problem in graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- scientific article; zbMATH DE number 6837043 (Why is no real title available?)
- NP-completeness of the \(\{k \}\)-packing function problem in graphs
- Multiple domination
- scientific article; zbMATH DE number 706830 (Why is no real title available?)
- On 2-limited packings of complete grid graphs
- A unified approach for domination and packing problems in graphs
- On k-(total) limited packing in graphs
- More on limited packings in graphs
- A polyhedral view to a generalization of multiple domination
This page was built for publication: The multiple domination and limited packing problems in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944215)
