The probabilistic approach to limited packings in graphs
(2015)
Journal Article
© 2014 Elsevier B.V. All rights reserved. We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for every vertex vεV(G), |N[v]∩X|≤k, where N[v] is the closed neighbourhoo... Read More about The probabilistic approach to limited packings in graphs.