Advertisement

Parameterized Complexity of Conflict-Free Graph Coloring

  • Hans L. Bodlaender
  • Sudeshna Kolay
  • Astrid PieterseEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11646)

Abstract

Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring \(c:V(G) \rightarrow \{1,2,\ldots ,q\}\) such that for each vertex \(v \in V(G)\) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(v). When we replace N(v) by the closed neighborhood N[v], then we call such a coloring a q-closed neighborhood conflict-free coloring or simply q-CNCF-coloring. In this paper, we study the NP-hard decision questions of whether for a constant q an input graph has a q-ONCF-coloring or a q-CNCF-coloring. We will study these two problems in the parameterized setting. First of all, we study running time bounds on FPT-algorithms for these problems, when parameterized by treewidth. We improve the existing upper bounds, and also provide lower bounds on the running time under ETH and SETH. Secondly, we study the kernelization complexity of both problems, using vertex cover as the parameter. We show that both \((q \ge 2)\)-ONCF-coloring and \((q \ge 3)\)-CNCF-coloring cannot have polynomial kernels when parameterized by the size of a vertex cover unless \(\mathsf {NP \subseteq coNP/poly}\). On the other hand, we obtain a polynomial kernel for 2-CNCF-coloring parameterized by vertex cover. We conclude the study with some combinatorial results. Denote \(\chi _{ON}(G)\) and \(\chi _{CN}(G)\) to be the minimum number of colors required to ONCF-color and CNCF-color G, respectively. Upper bounds on \(\chi _{CN}(G)\) with respect to structural parameters like minimum vertex cover size, minimum feedback vertex set size and treewidth are known. To the best of our knowledge only an upper bound on \(\chi _{ON}(G)\) with respect to minimum vertex cover size was known. We provide tight bounds for \(\chi _{ON}(G)\) with respect to minimum vertex cover size. Also, we provide the first upper bounds on \(\chi _{ON}(G)\) with respect to minimum feedback vertex set size and treewidth.

Keywords

Conflict-free coloring Kernelization Fixed-parameter tractability Combinatorial bounds 

References

  1. 1.
    Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloringfor rectangle ranges using \(O(n^{.382})\) colors. Discrete Comput. Geom. 48(1), 39–52 (2012).  https://doi.org/10.1007/s00454-012-9425-5MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. CoRR abs/1905.00305 (2019). https://arxiv.org/abs/1905.00305
  3. 3.
    Cheilaris, P.: Conflict-free coloring. Ph.D. thesis, City University of New York (2009)Google Scholar
  4. 4.
    Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-319-21275-3CrossRefzbMATHGoogle Scholar
  5. 5.
    Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. In: Proceedings of the 43rd FOCS, pp. 691–700 (2002).  https://doi.org/10.1109/SFCS.2002.1181994
  6. 6.
    Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566, 39–49 (2015).  https://doi.org/10.1016/j.tcs.2014.11.029MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Glebov, R., Szabó, T., Tardos, G.: Conflict-free colouring of graphs. Combin. Probab. Comput. 23(3), 434–448 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Har-Peled, S., Smorodinsky, S.: Conflict-free coloring of points and simpleregions in the plane. Discrete Comput. Geom. 34(1), 47–70 (2005).  https://doi.org/10.1007/s00454-005-1162-6MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. Inf. Comput. 231, 70–88 (2013).  https://doi.org/10.1016/j.ic.2013.08.005MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Jansen, B.M.P., Pieterse, A.: Optimal data reduction for graph coloring using low-degree polynomials. In: Proceedings of the 12th IPEC, pp. 22:1–22:12 (2017).  https://doi.org/10.4230/LIPIcs.IPEC.2017.22
  11. 11.
    Jansen, B.M.P., Pieterse, A.: Optimal sparsification for some binary CSPs using low-degree polynomials. CoRR abs/1606.03233v2 (2018)Google Scholar
  12. 12.
    Pach, J., Tardos, G.: Conflict-free colourings of graphs and hypergraphs. Combin. Probab. Comput. 18(05), 819–834 (2009).  https://doi.org/10.1017/S0963548309990290MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Smorodinsky, S.: Combinatorial problems in computational geometry. Ph.D. thesis, School of Computer Science, Tel-Aviv University (2003)Google Scholar
  14. 14.
    Smorodinsky, S.: Conflict-free coloring and its applications. In: Bárány, I., Böröczky, K.J., Tóth, G.F., Pach, J. (eds.) Geometry—Intuitive, Discrete, and Convex. BSMS, vol. 24, pp. 331–389. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-41498-5_12CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Hans L. Bodlaender
    • 1
  • Sudeshna Kolay
    • 2
  • Astrid Pieterse
    • 3
    Email author
  1. 1.Utrecht UniversityUtrechtNetherlands
  2. 2.Ben Gurion University of NegevBeershebaIsrael
  3. 3.Eindhoven University of TechnologyEindhovenNetherlands

Personalised recommendations