Pages that link to "Item:Q324745"
From MaRDI portal
The following pages link to NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745):
Displaying 5 items.
- Universal maximal packing functions of graphs (Q1126177) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- $$\{k\}$$-Packing Functions of Graphs (Q3195342) (← links)