Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-45587-7_14
+Normal rank
@@ Property / OpenAlex ID @@
+W2516984173
@@ Property / OpenAlex ID: W2516984173 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring the complexity boundary between coloring and list-coloring
+Normal rank
@@ Property / cites work @@
+The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
+Normal rank
@@ Property / cites work @@
+The multiple domination and limited packing problems in graphs
+Normal rank
@@ Property / cites work @@
+$$\{k\}$$-Packing Functions of Graphs
@@ Property / cites work: $$\{k\}$$-Packing Functions of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of the \(\{k \}\)-packing function problem in graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of the {<i>k</i>}-packing function problem
+Normal rank
@@ Property / cites work @@
+Limited Packings in Graphs
@@ Property / cites work: Limited Packings in Graphs / rank @@
+Normal rank