Mostafa Tavakoli

most citedThree algorithmic approaches to the general position problem

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

collaborators

2 papers

math.CO2025

Packing chromatic number of unitary Cayley graphs of $Z_{n}$ and algorithmic approaches to it

Zahra Hamed-Labbafian, Mostafa Tavakoli, Mojgan Afkhami +1

A packing $k$ -coloring of a graph $G$ is a partition of $V (G)$ into $k$ disjoint non-empty classes $V_{1}, \dots, V_{k}$ , such that if $u, v \in V_{i}$ , $i \in [k]$ , $u \neq = v$ , then the dis…

math.CO2025★ 1 cited

Three algorithmic approaches to the general position problem

Zahra Hamed-Labbafian, Narjes Sabeghi, Mostafa Tavakoli +1

If $G$ is a graph, then $X \subseteq V (G)$ is a general position set if for every two vertices $v, u \in X$ and every shortest $(u, v)$ -path $P$ , it holds that no inner vertex of $P$ l…

Packing chromatic number of unitary Cayley graphs of Zn​ and algorithmic approaches to it

Three algorithmic approaches to the general position problem

Packing chromatic number of unitary Cayley graphs of $Z_{n}$ and algorithmic approaches to it