Vizing's conjecture: a two-thirds bound for claw-free graphs
Combinatorics
2021-11-15 v2
Abstract
We show that for any claw-free graph and any graph , , where is the domination number of .
Cite
@article{arxiv.1607.06936,
title = {Vizing's conjecture: a two-thirds bound for claw-free graphs},
author = {Elliot Krop},
journal= {arXiv preprint arXiv:1607.06936},
year = {2021}
}
Comments
7 pages