Iztok Peterin

collaborators

7 papers

math.CO2026

On the Independence Number of the Modular Product

Tanja Dravec, Iztok Peterin

The \emph{modular product} $G ⋄ H$ of graphs $G$ and $H$ is a graph on vertex set $V (G) \times V (H)$ . Two vertices $(g, h)$ and $(g^{'}, h^{'})$ of $G ⋄ H$ are adjacent if $g=g'…

math.CO2026

On externally supported independence number of graphs

Dragana BoÅ¾oviÄ, Iztok Peterin, Adriana Roux +1

We introduce the \emph{externally supported independence number} $I^\pm_{es} (G)$ of a graph $G$ as the maximum cardinality of an independent set $B$ with an additional condition,…

math.CO2025

On acyclic b-chromatic number of cubic graphs

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G$ be a graph. An acyclic $k$ -coloring of $G$ is a map $c : V (G) \to {1, \dots, k}$ such that $c (u) \neq = c (v)$ for any $uv \in E (G)$ and the subgraph induced by the vertice…

math.CO2025

Independent mutual-visibility coloring and related concepts

BoÅ¡tjan BreÅ¡ar, Iztok Peterin, Babak Samadi +1

Given a graph $G$ , a subset $M \subseteq V (G)$ is a mutual-visibility (MV) set if for every $u, v \in M$ , there exists a $u, v$ -geodesic whose internal vertices are not in $M$ . We inve…

math.CO2025

On the star b-chromatic number of a graph

Dragana BoÅ¾oviÄ, DaÅ¡a MesariÄ Å tesl, Iztok Peterin

A star coloring of a graph $G$ is a proper coloring where vertices of every two color classes induce a forest of stars. A strict partial order is defined on the set of all star col…

math.CO2025

Grundy Packing Coloring of Graphs

Didem GÃ¶zÃ¼pek, Iztok Peterin

A map $c : V (G) \to {1, \dots, k}$ of a graph $G$ is a packing $k$ -coloring if every two different vertices of the same color $i \in {1, \dots, k}$ are at distance more than $i$ …