A note on the open packing number in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 553912 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 933213 (Why is no real title available?)
- On open packing number of graphs
- On packing and covering numbers of graphs
- Packing in trees
- Packing parameters in graphs
- Perfect codes in graphs
- Relations between packing and covering numbers of a tree
- Some remarks on domination
- Total Domination in Categorical Products of Graphs
- Total domination in graphs
- Total domination in graphs
Cited in
(8)- Open packing, total domination, and the P₃-Radon number
- Further results on packing related parameters in graphs
- Domination, total domination and open packing of the corcor domain of graphene
- On open packing number of graphs
- Outer-connected open packing sets in graphs
- On graphs having one size of maximal open packings
- Packings in bipartite prisms and hypercubes
- Unicyclic graphs with edge open packing number three
This page was built for publication: A note on the open packing number in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227166)