A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs

DOI10.1016/J.DAM.2020.03.056zbMath1443.05138OpenAlexW3015702250WikidataQ123286113 ScholiaQ123286113MaRDI QIDQ777412

Boštjan Brešar, Michael A. Henning

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.056

zbMATH Keywords

claw-free graphVizing's conjectureCartesian productdomination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved inequality related to Vizing's conjecture
• On domination and independent domination numbers of a graph
• Vizing's conjecture for graphs with domination number 3 -- a new proof
• Vizing's conjecture for chordal graphs
• A result on Vizing's conjecture
• An inequality related to Vizing's conjecture
• Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
• Vizing's conjecture: A two-thirds bound for claw-free graphs
• Domination in the hierarchical product and Vizing's conjecture
• A note on domination and independence-domination numbers of graphs
• Vizing's conjecture: a survey and recent results
• Partial product of graphs and Vizing's conjecture
• Fair reception and Vizing's conjecture
• Vizing's conjecture and the one-half argument

This page was built for publication: A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs