Iztok Peterin

activity

20122026

most citedDistance magic labeling and two products of graphs

20 citations · 67 across the 25 of their papers we have counts for

collaborators

Showing 2025Show all

4 papers · 1 filter

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

On the stress transit function

Arun Anil, Manoj Changat, Tanja Dravec +5

The stress interval $S (u, v)$ between $u, v \in V (G)$ is the set of all vertices in a graph $G$ that lie on every shortest $u, v$ -path. A set $U \subseteq V (G)$ is stress convex if $S(…