Bovstjan Brevsar

activity

20172026

most citedGraphs with a unique maximum open packing

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

collaborators

Showing 2020Show all

2 papers · 1 filter

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…

Domination in digraphs and their products

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

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