More on limited packings in graphs
From MaRDI portal
Publication:782753
DOI10.1007/s10878-020-00606-zzbMath1447.05166arXiv1807.01021OpenAlexW3036977115MaRDI QIDQ782753
Hong Chang, Xue Liang Li, Xu Qing Bai
Publication date: 29 July 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.01021
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limited packings in graphs
- A new upper bound on the total domination number of a graph
- On packing and covering numbers of graphs
- Relations between packing and covering numbers of a tree
- Packing in trees
- On the \(k\)-limited packing numbers in graphs
- The multiple domination and limited packing problems in graphs
- Packing parameters in graphs
- Packing parameters in graphs: new bounds and a solution to an open problem
- The probabilistic approach to limited packings in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- Perfect codes in graphs
- On Complementary Graphs
- Relationships between total domination, order, size, and maximum degree of graphs
- A Best Possible Heuristic for the k-Center Problem
- Total domination in graphs
- Upper total domination in claw‐free graphs
- Total Domination in Categorical Products of Graphs
This page was built for publication: More on limited packings in graphs