M. Jakovac

most citedOn graphs with equal total domination and Grundy total domination number

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

collaborators

3 papers

math.CO2021

On game chromatic vertex-critical graphs

Marko Jakovac, Daša Štesl

Several games that arise from graph coloring have been introduced and studied. Let $φ$ denote a graph invariant that arises from such a game. If $G$ is a graph and $φ(G-x)\neq φ(G)…

math.CO2021

The k-path vertex cover: general bounds and chordal graphs

Csilla Bujtás, Marko Jakovac, Zsolt Tuza

For an integer $k \geq 3$ , a $k$ -path vertex cover of a graph $G = (V, E)$ is a set $T \subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$ . The minimum cardina…

math.CO2019★ 5 cited

On graphs with equal total domination and Grundy total domination number

Tanja Gologranc, Marko Jakovac, Tim Kos +1

A sequence $(v_{1}, \dots, v_{k})$ of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v_{i}$ in the sequence totally dominates at…