Bovstjan Brevsar

activity

20172021

most citedGraphs with a unique maximum open packing

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

collaborators

5 papers

math.CO2021

On the dissociation number of Kneser graphs

Boštjan Brešar, Tanja Dravec

A set $D$ of vertices of a graph $G$ is a dissociation set if each vertex of $D$ has at most one neighbor in $D$ . The dissociation number of $G$ , $d i ss (G)$ , is the cardinality of a…

math.CO2020★ 1 cited

Domination in digraphs and their products

Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall

A dominating (respectively, total dominating) set $S$ of a digraph $D$ is a set of vertices in $D$ such that the union of the closed (respectively, open) out-neighborhoods of verti…

math.CO2020

$S$ -packing colorings of distance graphs $G (Z, {2, t})$

Boštjan Brešar, Jasmina Ferme, Karolína Kamenická

Given a graph $G$ and a non-decreasing sequence $S = (a_{1}, a_{2}, \dots)$ of positive integers, the mapping $f : V (G) \to {1, \dots, k}$ is an $S$ -packing $k$ -coloring of $G$ if…

math.CO2019★ 3 cited

Graphs with a unique maximum open packing

Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall

A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a uniq…

math.CO2017

Packing coloring of Sierpiński-type graphs

Boštjan Brešar, Jasmina Ferme

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_{i}$ , $i \in {1, \dots, k}$ , where ea…