Juho Lauri

activity

20162026

most citedAlgorithms and hardness results for happy coloring problems

15 citations · 20 across the 6 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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.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.…