A. Vesel

activity

20182020

collaborators

3 papers

math.CO2020

Efficient proper embedding of a daisy cube

Aleksander Vesel

For a set $X$ of binary words of length $h$ the daisy cube $Q_{h} (X)$ is defined as the subgraph of the hypercube $Q_{h}$ induced by the set of all vertices on shortest paths that conn…

math.CO2019

On the packing coloring of base-3 Sierpiński and $H$ graphs

Fei Deng, Zehui Shao, Aleksander Vesel

For a nondecreasing sequence of integers $S = (s_{1}, s_{2}, \dots)$ an $S$ -packing $k$ -coloring of a graph $G$ is a mapping from $V (G)$ to ${1, 2, \dots, k}$ such that vertices with c…

math.CO2018

Packing coloring of generalized Sierpinski graphs

Danilo Korze, Aleksander Vesel

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $c$ such that the vertex set $V (G)$ can be partitioned into sets $X_{1}, ..., X_{c}$ , with the condition…

Efficient proper embedding of a daisy cube

On the packing coloring of base-3 Sierpiński and H graphs

Packing coloring of generalized Sierpinski graphs

On the packing coloring of base-3 Sierpiński and $H$ graphs