An improved bound in Vizing's conjecture

DOI10.1007/s00373-019-02083-6zbMath1431.05118arXiv1706.03682OpenAlexW2972011300WikidataQ123167026 ScholiaQ123167026MaRDI QIDQ2287733

Shira Zerbib

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.03682

zbMATH Keywords

Vizing's conjectureCartesian productgraph domination

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 (5)

A new framework to approach Vizing's conjecture ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Domination in digraphs and their direct and Cartesian products ⋮ Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases ⋮ Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved inequality related to Vizing's conjecture
• An inequality related to Vizing's conjecture
• A Vizing-type result for semi-total domination
• Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
• Vizing's conjecture: a survey and recent results

This page was built for publication: An improved bound in Vizing's conjecture