UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE

DOI10.1080/16073606.1998.9632043zbMath0932.05074OpenAlexW2146404275MaRDI QIDQ4262044

Michael A. Henning

Publication date: 13 March 2000

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1998.9632043

zbMATH Keywords

treeboundpacking numberopen packing

Mathematics Subject Classification ID

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

Related Items (3)

Open packing saturation number of a graph ⋮ Changing and unchanging Open Packing: Edge removal ⋮ Open packing bondage number of a graph

Cites Work

• On packing and covering numbers of graphs
• Packing in trees
• Perfect codes in graphs

This page was built for publication: UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE