Bhyravarapu, S., Hartmann, T. A., Hoang, H. P., Kalyanasundaram, S., & Vinod Reddy, I. (2024). Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica, 1. https://doi.org/10.1007/s00453-024-01227-2
Chicago Style (17th ed.) CitationBhyravarapu, Sriram, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, and I. Vinod Reddy. "Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs." Algorithmica 2024: 1. https://doi.org/10.1007/s00453-024-01227-2.
MLA (9th ed.) CitationBhyravarapu, Sriram, et al. "Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs." Algorithmica, 2024, p. 1, https://doi.org/10.1007/s00453-024-01227-2.
Warning: These citations may not always be 100% accurate.