Parameterized algorithms for conflict-free colorings of graphs

Show simple item record

dc.contributor.author Reddy, I. Vinod
dc.coverage.spatial New York, US
dc.date.accessioned 2017-10-10T12:42:11Z
dc.date.available 2017-10-10T12:42:11Z
dc.date.issued 2017-09
dc.identifier.citation Reddy, I. Vinod, “Parameterized algorithms for conflict-free colorings of graphs”, arXiv, Cornell University Library, DOI: arXiv:1710.00223, Sep. 2017. en_US
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/3179
dc.description.abstract In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring problem is to color the vertices of a graph using the minimum number of colors such that the coloring is conflict-free. We consider both closed neighborhoods, where the neighborhood of a vertex includes itself, and open neighborhoods, where a vertex does not included in its neighborhood. We study the parameterized complexity of conflict-free closed neighborhood coloring and conflict-free open neighborhood coloring problems. We show that both problems are fixed-parameter tractable (FPT) when parameterized by the cluster vertex deletion number of the input graph. This generalizes the result of Gargano et al.(2015) that conflict-free coloring is fixed-parameter tractable parameterized by the vertex cover number. Also, we show that both problems admit an additive constant approximation algorithm when parameterized by the distance to threshold graphs. We also study the complexity of the problem on special graph classes. We show that both problems can be solved in polynomial time on cographs. For split graphs, we give a polynomial time algorithm for closed neighborhood conflict-free coloring problem, whereas we show that open neighborhood conflict-free coloring is NP-complete. We show that interval graphs can be conflict-free colored using at most four colors. en_US
dc.description.statementofresponsibility by I. Vinod Reddy
dc.language.iso en en_US
dc.publisher Cornell University Library en_US
dc.relation.uri http://arxiv.org/abs/1710.00223
dc.title Parameterized algorithms for conflict-free colorings of graphs en_US
dc.type Preprint en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account