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 cs.DMShow all

2 papers · 1 filter

cs.DM2011

Packing Chromatic Number of Distance Graphs

Jan Ekstein, Přemysl Holub, Bernard Lidický

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

cs.DM2010

The packing chromatic number of the square lattice is at least 12

Jan Ekstein, Jiří Fiala, Přemysl Holub +1

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