Packing parameters in graphs

DOI10.7151/dmgt.1775zbMath1307.05183OpenAlexW2011235544MaRDI QIDQ2259558

Yanyan Li

Publication date: 4 March 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1775

zbMATH Keywords

packing numberopen packing number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (14)

Graphs with unique maximum packing of closed neighborhoods ⋮ Outer-connected open packing sets in graphs ⋮ Open packing subdivision number of graphs ⋮ (Open) packing number of some graph products ⋮ Open packing saturation number of a graph ⋮ Injective coloring of graphs revisited ⋮ Total limited packing in graphs ⋮ On the packing numbers in graphs ⋮ A note on the open packing number in graphs ⋮ OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS ⋮ Open packing bondage number of a graph ⋮ More on limited packings in graphs ⋮ Packing parameters in graphs: new bounds and a solution to an open problem ⋮ Further results on packing related parameters in graphs

Cites Work

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

This page was built for publication: Packing parameters in graphs