Limited packings in graphs
From MaRDI portal
Publication:987685
DOI10.1016/J.DAM.2009.04.014zbMATH Open1218.05132OpenAlexW2006409610MaRDI QIDQ987685FDOQ987685
Authors: Georg Gunther, Bert L. Hartnell, Douglas F. Rall, Robert P. Gallant 
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.014
Recommendations
Cited In (35)
- A polyhedral view to a generalization of multiple domination
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Packing parameters in graphs: new bounds and a solution to an open problem
- Title not available (Why is that?)
- New bounds on the signed total domination number of graphs
- On the packing numbers in graphs
- Further results on packing related parameters in graphs
- Labelled packing functions in graphs
- On the \(k\)-limited packing numbers in graphs
- On the number of 2-packings in a connected graph
- An introduction to set-sized packing
- A new approach on locally checkable problems
- On the signed \(2\)-independence number of graphs
- The packing coloring problem for lobsters and partner limited graphs
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- On the complexity of the {\(k\)}-packing function problem
- The packing number of cubic graphs
- New and improved results on the signed (total) \(k\)-domination number of graphs
- The probabilistic approach to limited packings in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- Total limited packing in graphs
- On the signed (total) \(k\)-independence number in graphs
- Graphs with unique maximum packing of closed neighborhoods
- NP-completeness of the \(\{k \}\)-packing function problem in graphs
- On maximal \(k\)-limited packings
- Title not available (Why is that?)
- Limited Packings in Graphs
- (Open) packing number of some graph products
- A new probabilistic lower bound on the limited packing number of a graph
- More on limited packings in graphs
- Uniformly dissociated graphs
- Polynomial reductions between the limited packing and tuple domination problems in graphs
- The multiple domination and limited packing problems in graphs
- Limited packings: related vertex partitions and duality issues
- On 2-limited packings of complete grid graphs
This page was built for publication: Limited packings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987685)
