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 math.COShow all

3 papers · 1 filter

math.CO2026

A disproof of a gap-one conjecture for the equitable chromatic number of block graphs

Juho Lauri

For a graph $G$ , let $L (G) = max {ω (G), ⌈(∣ V (G) ∣ + 1) / (α_{m i n} (G) + 1)⌉}$ , where $ω (G)$ is the clique number and $α_{m i n} (G)$ is the minimum, over all vertices $v$ , of the…

math.CO2020

Upper Bounding Rainbow Connection Number by Forest Number

L. Sunil Chandran, Davis Issac, Juho Lauri +1

A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertic…

math.CO2016

The square of the 9-hypercube is 14-colorable

Juho Lauri

The $n$ -hypercube, denoted by $Q_{n}$ , has a vertex for each bit string of length $n$ with two vertices adjacent whenever their Hamming distance is one. The minimum number of colors…