Limited packings in graphs
From MaRDI portal
Publication:987685
DOI10.1016/j.dam.2009.04.014zbMath1218.05132OpenAlexW2006409610MaRDI QIDQ987685
Georg Gunther, Douglas F. Rall, Bert L. Hartnell, 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
Related Items (24)
New bounds on the signed total domination number of graphs ⋮ A new approach on locally checkable problems ⋮ A polyhedral view to a generalization of multiple domination ⋮ NP-completeness of the \(\{k \}\)-packing function problem in graphs ⋮ Graphs with unique maximum packing of closed neighborhoods ⋮ New and improved results on the signed (total) k-domination number of graphs ⋮ On the signed (total) \(k\)-independence number in graphs ⋮ (Open) packing number of some graph products ⋮ The multiple domination and limited packing problems in graphs ⋮ Uniformly dissociated graphs ⋮ On the complexity of the {k}-packing function problem ⋮ Limited packing and multiple domination problems: polynomial time reductions ⋮ On the \(k\)-limited packing numbers in graphs ⋮ On 2-limited packings of complete grid graphs ⋮ Labelled packing functions in graphs ⋮ Total limited packing in graphs ⋮ On the packing numbers in graphs ⋮ Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs ⋮ More on limited packings in graphs ⋮ Packing parameters in graphs: new bounds and a solution to an open problem ⋮ On the signed 2-independence number of graphs ⋮ The probabilistic approach to limited packings in graphs ⋮ Generalized limited packings of some graphs with a limited number of \(P_4\)-partners ⋮ Further results on packing related parameters in graphs
This page was built for publication: Limited packings in graphs
