Interval Graphs

Conflict-free coloring on subclasses of perfect graphs and bipartite graphs

A Conflict-Free Open Neighborhood coloring, abbreviated CFON coloring, of a graph $G = (V, E)$ using $k$ colors is an assignment of colors from a set of $k$ colors to a subset of vertices of $V$ such that every vertex sees some color exactly once in …

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs

A _Conflict-Free Open Neighborhood coloring_, abbreviated CFON* coloring, of a graph $G = (V,E)$ using $k$ colors is an assignment of colors from a set of $k$ colors to a subset of vertices of $V(G)$ such that every vertex sees some color exactly …