5 citations · 7 across the 4 of their papers we have counts for
4 papers
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 is a graph and $φ(G-x)\neq φ(G)…
The k-path vertex cover: general bounds and chordal graphs
Csilla Bujtás, Marko Jakovac, Zsolt Tuza
For an integer , a -path vertex cover of a graph is a set that shares a vertex with every path subgraph of order in . The minimum cardina…
-packing chromatic vertex-critical graphs
Přemysl Holub, Marko Jakovac, Sandi Klavžar
For a non-decreasing sequence of positive integers , the {\em -packing chromatic number} of is the smallest integer such that the vertex s…
On graphs with equal total domination and Grundy total domination number
Tanja Gologranc, Marko Jakovac, Tim Kos +1
A sequence of vertices in a graph without isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at…