Open packing saturation number of a graph

DOI10.1142/S1793557117500334MaRDI QIDQ5355167zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Packing parameters in graphs
• scientific article; zbMATH DE number 1286740
• Open packing subdivision number of graphs
• Open packing bondage number of a graph
• Outer-connected open packing sets in graphs

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3747184 (Why is no real title available?)
• scientific article; zbMATH DE number 1286740 (Why is no real title available?)
• Domsaturation number of a graph
• Independence saturation and extended domination chain in graphs
• Irredundance saturation number of a graph
• On open packing number of graphs
• Packing parameters in graphs
• Relations between packing and covering numbers of a tree
• UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE

Cited in

(3)

• Open packing subdivision number of graphs
• Effect of open packing upon vertex removal
• Packing parameters in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355167)