Author:
Bhyravarapu Sriram,Hartmann Tim A.,Hoang Hung P.,Kalyanasundaram Subrahmanyam,Vinod Reddy I.
Funder
Science and Engineering Research Board
Austrian Science Fund
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. 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. Discret. Math. 32(4), 2675–2702 (2018)
2. Agrawal, A., Ashok, P., Reddy, M.M., Saurabh, S., Yadav, D.: FPT algorithms for conflict-free coloring of graphs and chromatic terrain guarding. arXiv:1905.01822 (2019)
3. Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182–208 (1986)
4. Bergougnoux, B., Dreier, J., Jaffke, L.: A logic-based algorithmic meta-theorem for mim-width. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22–25, 2023, pp. 3282–3304. SIAM (2023)
5. Bhyravarapu, S., Hartmann, T.A., Kalyanasundaram, S., VinodReddy, I.: Conflict-free coloring: Graphs of bounded clique width and intersection graphs. In: Combinatorial Algorithms, pp. 92–106. Springer, Cham (2021)