Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs

Abstract

Full Citation:

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy. Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica, volume 86, number 7, pages 2250-2288, 2024.

Phuc Hung Hoang

Phuc Hung Hoang is a Project Assistant at the Algorithms and Complexity Group.