B. Brešar

activity

20092024

most citedMinimum k-path vertex cover

167 citations · 213 across the 9 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

On Grundy total domination number in product graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6

A longest sequence $(v_{1}, \dots, v_{k})$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$ , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…

math.CO2017

Packing chromatic number versus chromatic and clique number

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

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 [k]$ , where each $V_{i}$ is…

math.CO2017★ 2 cited

Grundy dominating sequences and zero forcing sets

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5

In a graph $G$ a sequence $v_{1}, v_{2}, \dots, v_{m}$ of vertices is Grundy dominating if for all $2 \leq i \leq m$ we have $N [v_{i}] \neq \subseteq \cup_{j = 1}^{i - 1} N [v_{j}]$ and is Grundy total do…