J. Ekstein

activity

20112013

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2012

Radio Labelings of Distance Graphs

R. Čada, J. Ekstein, P. Holub +1

A radio $k$ -labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $∣ c (x) - c (y) ∣ \geq k + 1 - d (x, y),$ for any two vertic…

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

Radio Labelings of Distance Graphs

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