Abstract
In an undirected graph G, a conflict-free coloring with respect to open neighborhoods (denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for a CFON coloring of G is the CFON chromatic number of G, denoted by \(\chi _{ON}(G)\). The decision problem that asks whether \(\chi _{ON}(G)\le k\) is NP-complete. Structural as well as algorithmic aspects of this problem have been well studied. We obtain the following results for \(\chi _{ON}(G)\):
-
Bodlaender, Kolay and Pieterse (WADS 2019) showed the upper bound \(\chi _{ON}(G)\le \mathsf{fvs}(G) + 3\), where \(\mathsf{fvs}(G)\) denotes the size of a minimum feedback vertex set of G. We show the improved bound of \(\chi _{ON}(G)\le \mathsf{fvs}(G) + 2\), which is tight, thereby answering an open question in the above paper.
-
We study the relation between \(\chi _{ON}(G)\) and the pathwidth of the graph G, denoted \(\mathsf{pw}(G)\). The above paper from WADS 2019 showed the upper bound \(\chi _{ON}(G)\le 2\mathsf{tw}(G) + 1\) where \(\mathsf{tw}(G)\) stands for the treewidth of G. This implies an upper bound of \(\chi _{ON}(G)\le 2\mathsf{pw}(G) + 1\). We show an improved bound of \(\chi _{ON}(G)\le \left\lfloor \frac{5}{3}(\mathsf{pw}(G) + 1)\right\rfloor \).
-
We prove new bounds for \(\chi _{ON}(G)\) with respect to the structural parameters neighborhood diversity and distance to cluster, improving the existing results of Gargano and Rescigno (Theor. Comput. Sci. 2015) and Reddy (Theor. Comput. Sci. 2018), respectively. Furthermore, our techniques also yield improved bounds for the closed neighborhood variant of the problem.
-
We prove bounds for \(S_k\)-free graphs where \(S_k\) is a star on \(k+1\) vertices. For a graph G with maximum degree \(\Delta \), it is known that \(\chi _{ON}(G)\le \Delta + 1\) and this bound is tight in general. When G is \(S_k\)-free, we show that \(\chi _{ON}(G)= O(k\cdot \log ^{2+\epsilon }\Delta )\), for any \(\epsilon > 0\). In particular, when G is claw-free, this implies that \(\chi _{ON}(G)= O(\log ^{2 + \epsilon }\Delta )\). Further, we show existence of claw-free graphs that require \(\Omega (\log \Delta )\) colors.
-
We also study the partial coloring variant of the CFON coloring problem, which allows vertices to be left uncolored. Let \(\chi ^*_{ON}(G)\) denote the minimum number of colors required to color G as per this variant. Abel et al. (SIDMA 2018) showed that \(\chi ^*_{ON}(G)\le 8\) when G is planar. They asked if fewer colors would suffice for planar graphs. We answer this question by showing that \(\chi ^*_{ON}(G)\le 5\) for all planar G. This approach also yields the bound \(\chi ^*_{ON}(G)\le 4\) for all outerplanar G.
All our bounds are a result of constructive algorithmic procedures.
Similar content being viewed by others
Notes
In the case where X is a special bag that introduces two vertices, at most one of the two introduced vertices can be part of an expensive subset.
The vertex \(v'_i\) may or may not be the same as \(v_i\).
The vertices \(v'_i\) may or may not be the same as \(v_i\).
Values \(C_i(v)\) that are not assigned are notionally set to 0.
The condition marked \(\star \) is violated in a few cases. In the exceptional cases where it is violated, we shall explain how the cases are handled.
The coloring assigned in this proof does not satisfy the condition marked \(\star \). However, this is not an issue since we are coloring the whole of G in this lemma.
References
Bhyravarapu, S., Kalyanasundaram, S.: Combinatorial bounds for conflict-free coloring on open neighborhoods. In: Graph-Theoretic Concepts in Computer Science—46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, 2020, pp. 1–13. https://doi.org/10.1007/978-3-030-60440-0_1
Bhyravarapu, S., Kalyanasundaram, S., Mathew, R.: Conflict-free coloring of star-free graphs on open neighborhoods (2020). arXiv:2009.06720
Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J. Comput. 33(1), 94–136 (2004). https://doi.org/10.1137/S0097539702431840
Smorodinsky, S.: Conflict-Free Coloring and its Applications, pp. 331–389. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-41498-5_12
Abel, Z., Alvarez, V., Demaine, E.D., Fekete, S.P., Gour, A., Hesterberg, A., Keldenich, P., Scheffer, C.: Conflict-free coloring of graphs. SIAM J. Discrete Math. 32(4), 2675–2702 (2018). https://doi.org/10.1137/17M1146579
Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theor. Comput. Sci. 566(C), 39–49 (2015). https://doi.org/10.1016/j.tcs.2014.11.029
Reddy, I.V.: Parameterized algorithms for conflict-free colorings of graphs. Theor. Comput. Sci. 745, 53–62 (2018). https://doi.org/10.1016/j.tcs.2018.05.025
Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. In: Proceedings of the 16th Intl. Symposium on Algorithms and Data Structures, WADS, 2019, pp. 168–180. https://doi.org/10.1007/978-3-030-24766-9_13
Agrawal, A., Ashok, P., Reddy, M.M., Saurabh, S., Yadav, D.: FPT algorithms for conflict-free coloring of graphs and chromatic terrain guarding. CoRR abs/1905.01822. arXiv:1905.01822
Keller, C., Smorodinsky, S.: Conflict-free coloring of intersection graphs of geometric objects. Discrete Comput. Geometry (2019). https://doi.org/10.1007/s00454-019-00097-8
Fekete, S.P., Keldenich, P.: Conflict-free coloring of intersection graphs. Int. J. Comput. Geometry Appl. 28(03), 289–307 (2018). https://doi.org/10.1142/S0218195918500085
Chen, K., Fiat, A., Kaplan, H., Levy, M., Matoušek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., Welzl, E.: Online conflict-free coloring for intervals. SIAM J. Comput. 36(5), 1342–1359 (2006). https://doi.org/10.1137/S0097539704446682
Pach, J., Tardos, G.: Conflict-free colourings of graphs and hypergraphs. Combinat. Probab. Comput. 18(5), 819–834 (2009). https://doi.org/10.1017/S0963548309990290
Cheilaris, P.: Conflict-free coloring. Ph.D. thesis, New York, NY, USA (2009)
Bhyravarapu, S., Kalyanasundaram, S.: A tight bound for conflict-free coloring in terms of distance to cluster (2020). arXiv:2010.00063
Huang, F., Guo, S., Yuan, J.: A short note on open-neighborhood conflict-free colorings of graphs. SIAM J. Discrete Math. 34(3), 2009–2015 (2020). https://doi.org/10.1137/19M1272111
Cygan, M., Fomin, F.V., Kowalik, Ł, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, Berlin (2016)
Chandrasekaran, K., Goyal, N., Haeupler, B.: Deterministic algorithms for the Lovász local lemma. SIAM J. Comput. 42(6), 2132–2155 (2013). https://doi.org/10.1137/100799642
Harris, D.G.: Deterministic algorithms for the Lovász local lemma: simpler, more general, and more parallel. arXiv preprint. arXiv:1909.08065
Dębski, M., Przybyło, J.: Conflict-free chromatic number versus conflict-free chromatic index. J. Graph Theory. (2022). https://doi.org/10.1002/jgt.22743
Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Comb. Theory Ser. B 70(1), 2–44 (1997). https://doi.org/10.1006/jctb.1997.1750
Diestel, R.: Graph Theory. Springer, Berlin (2005)
Aubry, Y., Godin, J.-C., Togni, O.: Free choosability of outerplanar graphs. Graphs Combinat. 32(3), 851–859 (2016). https://doi.org/10.1007/s00373-015-1625-3
Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229–232 (1979). https://doi.org/10.1016/0020-0190(79)90075-9
Acknowledgements
We would like to thank N. R. Aravind for helpful discussions. We would also like to thank the anonymous reviewer of WG2020 who pointed out an issue with the proof of Theorem 6. The second author acknowledges DST-SERB (MTR/2020/000497) for supporting this research. The third author acknowledges DST-SERB (MTR/2019/000550) for supporting this research.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This paper is a combination of the articles [1, 2], the first of which appeared in the proceedings of 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2020).
This work was done while Sriram Bhyravarapu was pursuing his Ph.D. at IIT Hyderabad.
Rights and permissions
About this article
Cite this article
Bhyravarapu, S., Kalyanasundaram, S. & Mathew, R. Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica 84, 2154–2185 (2022). https://doi.org/10.1007/s00453-022-00956-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-00956-6