The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs☆
References (10)
Domination, independent domination, and duality in strongly chordal graphs
Discrete Applies Mathematics
(1984)- et al.
Limited Packings in graphs
Electronic Notes in Discrete Mathematics
(2008) - et al.
A tree representation of P4-sparse graphs
Disc. Appl. Math
(1992) - et al.
k-tuple domination in graphs
Inform. Process. Letters
(2003) - et al.
Arbitrarly limited packings in trees
There are more references available in the full text version of this article.
Cited by (12)
On general packing functions in graphs (Brief Announcement)
2023, Procedia Computer ScienceLabelled packing functions in graphs
2020, Information Processing LettersNP-completeness of the {k}-packing function problem in graphs
2015, Electronic Notes in Discrete MathematicsGeneralized limited packings of some graphs with a limited number of P<inf>4</inf>-partners
2015, Theoretical Computer ScienceCitation Excerpt :The all ones vector is denoted by 1. Let us introduce GLP formally [2]. In this section, we show how to handle generalized limited packings and some graph operations such as union and join.
Limited Packing and Multiple Domination problems: Polynomial time reductions
2014, Discrete Applied MathematicsCitation Excerpt :Second, some places where to locate the facilities may be “not allowed” (for the packing case) and “required” (for the covering case). In this sense, generalized versions for MD and LP were first introduced in [8,3], respectively. In Section 4, we prove that, within graph classes that are closed under certain operations, LP and MD are, respectively, “as hard” as their generalizations.
The multiple domination and limited packing problems in graphs
2011, Information Processing Letters
- ☆
Partially supported by grant of ANPCyT-PICT 38036 (2005).
Copyright © 2010 Elsevier B.V. All rights reserved.