Andrej Taranenko

activity

20142024

most citedA note on the Thue chromatic number of lexicographic products of graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

The strong vertex span of trees

Mateja Grašič, Chris Mouron, Andrej Taranenko

The strong vertex (edge) span of a given graph $G$ is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of $G$ and moving either t…

math.CO2016

Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko +1

Let $G = (V, E)$ be a connected graph. A vertex $w \in V$ distinguishes two elements (vertices or edges) $x, y \in E \cup V$ if $d_{G} (w, x) \neq = d_{G} (w, y)$ . A set $S$ of vertices in a connecte…

math.CO2014★ 2 cited

A note on the Thue chromatic number of lexicographic products of graphs

Iztok Peterin, Jens Schreyer, Erika Škrabuľáková +1

A sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_{1}, r_{2}, \dots, r_{2 n}$ such that $r_{i} = r_{n + i}$ for all $1 \leq i \leq n$ ). Let $G$ be a…