Vizing's conjecture: A two-thirds bound for claw-free graphs

DOI10.1016/j.dam.2017.06.017zbMath1368.05113arXiv1607.06936OpenAlexW2963100325WikidataQ123017722 ScholiaQ123017722MaRDI QIDQ2399303

Elliot Krop

Publication date: 22 August 2017

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

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

zbMATH Keywords

Vizing's conjecturedomination 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 (1)

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

Cites Work

• 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
• A result on Vizing's conjecture
• Vizing's conjecture: a survey and recent results
• A Class of Graphs Approaching Vizing's Conjecture

This page was built for publication: Vizing's conjecture: A two-thirds bound for claw-free graphs