Christodoulos Mitillos

collaborators

3 papers

cs.DM2021

Exact defective colorings of graphs

James Cumberbatch, Juho Lauri, Christodoulos Mitillos

An exact $(k, d)$ -coloring of a graph $G$ is a coloring of its vertices with $k$ colors such that each vertex $v$ is adjacent to exactly $d$ vertices having the same color as $v$ . T…

cs.CC2019

Complexity of fall coloring for restricted graph classes

Juho Lauri, Christodoulos Mitillos

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned int…

cs.DM2019

Perfect Italian domination on planar and regular graphs

Juho Lauri, Christodoulos Mitillos

A perfect Italian dominating function of a graph $G = (V, E)$ is a function $f : V \to {0, 1, 2}$ such that for every vertex $f (v) = 0$ , it holds that $\sum_{u \in N (v)} f (u) = 2$ , i.…