On the packing numbers in graphs

zbMath1404.05170arXiv1707.08656MaRDI QIDQ4614038

Doost Ali Mojdeh, Hamid Reza Golmohammadi, Babak Samadi, Abdollah Khodkar

Publication date: 30 January 2019

Full work available at URL: https://arxiv.org/abs/1707.08656

zbMATH Keywords

\(k\)-limited packing numbers

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

Graphs with unique maximum packing of closed neighborhoods ⋮ Outer-connected open packing sets in graphs ⋮ (Open) packing number of some graph products ⋮ OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS

Cites Work

• \(k\)-domination and \(k\)-independence in graphs: A survey
• Limited packings in graphs
• Relations between packing and covering numbers of a tree
• Packing parameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the packing numbers in graphs