Packing in trees

DOI10.1016/S0012-365X(97)00228-8zbMath0957.05090OpenAlexW1978107827MaRDI QIDQ1584274

Michael A. Henning

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00228-8

zbMATH Keywords

treepacking numberopen packing

Mathematics Subject Classification ID

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

Related Items (11)

UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE ⋮ Total domination and open packing in some chemical graphs ⋮ Liar's dominating sets in graphs ⋮ Exponential independence ⋮ Outer-connected open packing sets in graphs ⋮ Cartesian product graphs and k-tuple total domination ⋮ A note on bounds for the broadcast domination number of graphs ⋮ On the \(k\)-limited packing numbers in graphs ⋮ Packing parameters in graphs ⋮ A note on the open packing number in graphs ⋮ More on limited packings in graphs

Cites Work

• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree
• Perfect codes in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing in trees