J. Ekstein

activity

20102025

most cited3-coloring triangle-free planar graphs with a precolored 9-cycle

5 citations · 5 across the 12 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

1 paper · 2 filters

math.CO2013

The Packing Coloring of Distance Graphs $D (k, t)$

Jan Ekstein, Přemysl Holub, Olivier Togni

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertic…

The Packing Coloring of Distance Graphs D(k,t)

The Packing Coloring of Distance Graphs $D (k, t)$