Vizing's conjecture: a two-thirds bound for claw-free graphs
Abstract
We show that for any claw-free graph G and any graph H, γ(G H)≥ 23γ(G)γ(H), where γ(G) is the domination number of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.