Sandi Klavzar

collaborators

3 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

Maker-Breaker domination game critical graphs

Athira Divakaran, Tanja Dravec, Tijo James +2

The Maker-Breaker domination game (MBD game) is a two-player game played on a graph $G$ by Dominator and Staller. They alternately select unplayed vertices of $G$ . The goal of Domi…

math.CO2024

Maker-Breaker domination game played on corona products of graphs

Athira Divakaran, Tijo James, Sandi KlavÅ¾ar +1

In the Maker-Breaker domination game, Dominator and Staller play on a graph $G$ by taking turns in which each player selects a not yet played vertex of $G$ . Dominator's goal is to…

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

Maker-Breaker domination game critical graphs

Maker-Breaker domination game played on corona products of graphs

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