An Improvement in the Two-packing Bound Related to Vizing's Conjecture

DOI10.20429/TAG.2020.070105zbMATH Open1447.05162OpenAlexW3019407154MaRDI QIDQ5119802

Kimber Wolff

Publication date: 1 September 2020

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2020.070105

zbMATH Keywords

domination numberCartesian product of graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

A decomposition of 2-weak vertex-packing polytopes ⋮ (Open) packing number of some graph products ⋮ Improving bounds on packing densities of 4-point permutations ⋮ An improved bound in Vizing's conjecture

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An improved inequality related to Vizing's conjecture 👍 👎
• An improved kernelization for \(P_{2}\)-packing 👍 👎
• Two theorems on packings of graphs 👍 👎
• An improvement on Vizing's conjecture 👍 👎
• An improved bound in Vizing's conjecture 👍 👎
• An improved bound on the packing dimension of Furstenberg sets in the plane 👍 👎
• A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability 👍 👎
• On Two Conjectures on Packing of Graphs 👍 👎

This page was built for publication: An Improvement in the Two-packing Bound Related to Vizing's Conjecture

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