Open packing saturation number of a graph

DOI10.1142/S1793557117500334zbMath1370.05169OpenAlexW2479889758MaRDI QIDQ5355167

No author found.

Publication date: 6 September 2017

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557117500334

zbMATH Keywords

packing numberopen packing number

Mathematics Subject Classification ID

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

Cites Work

• Relations between packing and covering numbers of a tree
• Domsaturation number of a graph
• Packing parameters in graphs
• Independence saturation and extended domination chain in graphs
• UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE
• On Open Packing Number of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open packing saturation number of a graph