Further results on packing related parameters in graphs
From MaRDI portal
Publication:2118231
Recommendations
Cites work
- scientific article; zbMATH DE number 3650577 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1286740 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A new lower bound on the total domination number of a tree.
- A note on the total domination number of a tree
- A survey of Nordhaus-Gaddum type relations
- Limited packings in graphs
- On Complementary Graphs
- On domination number and distance in graphs
- On open packing number of graphs
- On the \(k\)-limited packing numbers in graphs
- Packing parameters in graphs
- Packing parameters in graphs: new bounds and a solution to an open problem
- Relations between packing and covering numbers of a tree
- Roman domination in graphs.
- Some comments on the Slater number
- Total Domination in Categorical Products of Graphs
- Total and paired-domination numbers of a tree
- Total domination in graphs
- Total domination in graphs
Cited in
(7)- Packing parameters in graphs: new bounds and a solution to an open problem
- A short update on equipackable graphs
- Open packing, total domination, and the P₃-Radon number
- Some results on packing graphs in their complements
- Packings in bipartite prisms and hypercubes
- Packing and domination parameters in digraphs
- On the ratios between packing and domination parameters of a graph
This page was built for publication: Further results on packing related parameters in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118231)