Pages that link to "Item:Q1944215"
From MaRDI portal
The following pages link to The multiple domination and limited packing problems in graphs (Q1944215):
Displaying 20 items.
- NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
- On 2-limited packings of complete grid graphs (Q526269) (← links)
- More on limited packings in graphs (Q782753) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- A polyhedral view to generalized multiple domination and limited packing (Q1661908) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- The probabilistic approach to limited packings in graphs (Q2341760) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Limited packing and multiple domination problems: polynomial time reductions (Q2448892) (← links)
- Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672) (← links)
- Polynomial reductions between the limited packing and tuple domination problems in graphs (Q2840710) (← links)
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs (Q2883613) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs (Q3128208) (← links)
- (Q3134381) (← links)
- Multiple Domination (Q3384609) (← links)
- (Q4318220) (← links)