paper

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

arXiv:1607.06936 · doi:10.1016/j.dam.2017.06.017

Abstract

We show that for any claw-free graph and any graph , , where is the domination number of .

7 pages

Cited by in corpus (1)