Limited Packings in Graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- On the \(k\)-limited packing numbers in graphs
- On the number of 2-packings in a connected graph
- Graphs with unique maximum packing of closed neighborhoods
- The probabilistic approach to limited packings in graphs
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- The packing coloring problem for lobsters and partner limited graphs
- Total limited packing in graphs
- Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
- Polynomial reductions between the limited packing and tuple domination problems in graphs
- On the k-dominating set polytope of web graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- On maximal k-limited packings
- scientific article; zbMATH DE number 6837043 (Why is no real title available?)
- scientific article; zbMATH DE number 1506512 (Why is no real title available?)
- An introduction to set-sized packing
- A new probabilistic lower bound on the limited packing number of a graph
- On 2-limited packings of complete grid graphs
- Limited packings: related vertex partitions and duality issues
- More on limited packings in graphs
- A polyhedral view to a generalization of multiple domination
- Limited packings in 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 Q3503525)