Domination When the Stars Are Out
From MaRDI portal
DOI10.1007/978-3-642-22006-7_39zbMATH Open1334.68160arXiv1012.0012OpenAlexW3147303226WikidataQ128003225 ScholiaQ128003225MaRDI QIDQ3012826
Author name not available (Why is that?)
Publication date: 6 July 2011
Published in: (Search for Journal in Brave)
Abstract: We algorithmize the recent structural characterization for claw-free graphs by Chudnovsky and Seymour. Building on this result, we show that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel. To complement these results, we establish that Dominating Set is not fixed-parameter tractable on the slightly larger class of graphs that exclude K_{1,4} as an induced subgraph (K_{1,4}-free graphs). We show that our algorithmization can also be used to show that the related Connected Dominating Set problem is fixed-parameter tractable on claw-free graphs. To complement that result, we show that Connected Dominating Set has no polynomial kernel on claw-free graphs and is not fixed-parameter tractable on K_{1,4}-free graphs. Combined, our results provide a dichotomy for Dominating Set and Connected Dominating Set on K_{1,L}-free graphs and show that the problem is fixed-parameter tractable if and only if L <= 3.
Full work available at URL: https://arxiv.org/abs/1012.0012
No records found.
No records found.
This page was built for publication: Domination When the Stars Are Out
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012826)
