Andrej Taranenko

activity

20142025

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

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

collaborators

4 papers

math.CO2025

The radius capture number

Tanja Dravec, Vesna Iršič Chenoweth, Andrej Taranenko

In the classic cop and robber game, two players--the cop and the robber--take turns moving to a neighboring vertex or staying at their current position. The cop aims to capture the…

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…