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 2016Show all

3 papers · 1 filter

math.CO2016

Dominating sequences in grid-like and toroidal graphs

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

A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…

math.CO2016

$1$ -perfectly orientable $K_{4}$ -minor-free and outerplanar graphs

Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos +1

A graph $G$ is said to be $1$ -perfectly orientable if it has an orientation such that for every vertex $v \in V (G)$ , the out-neighborhood of $v$ in $D$ is a clique in $G$ . In $1982$ …

math.CO2016

Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

Bostjan Bresar, Tanja Gologranc, Tim Kos

A sequence $S = (v_{1}, \dots, v_{k})$ of distinct vertices of a graph $G$ is called a legal sequence if $N [v_{i}] ∖ \cup_{j = 1}^{i - 1} N [v_{j}] \neq = \emptyset$ for any $i$ . The maximum l…

Dominating sequences in grid-like and toroidal graphs

1-perfectly orientable K4​-minor-free and outerplanar graphs

Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

$1$ -perfectly orientable $K_{4}$ -minor-free and outerplanar graphs