Marko Jakovac

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Settling the total domination-annihilation conjecture for graphs with minimum degree two

Marko Jakovac

The total domination number $γ_{t} (G)$ of a graph $G$ is the minimum cardinality of a set $D \subseteq V (G)$ such that every vertex of $G$ has a neighbor in $D$ . The annihilation numb…

math.CO2026

Sequence b-colorings in graphs

Marko Jakovac, Michael S. Lang

We introduce and begin the study of sequence b-colorings, a natural generalization of the classical notion of b-colorings introduced by Irving and Manlove in 1999. In a sequence b-…

math.CO2024

Burning game

Nina Chiarelli, Vesna Iršič, Marko Jakovac +2

Motivated by the burning and cooling processes, the burning game is introduced. The game is played on a graph $G$ by the two players (Burner and Staller) that take turns selecting…

math.CO2024

$S$ -packing colorings of distance graphs with distance sets of cardinality $2$

Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots)$ of positive integers, a partition of the vertex set of a graph $G$ into subsets $X_{1}, \dots, X_{ℓ}$ , such that vertices in $X_{i}$ …

Settling the total domination-annihilation conjecture for graphs with minimum degree two

Sequence b-colorings in graphs

Burning game

S-packing colorings of distance graphs with distance sets of cardinality 2

$S$ -packing colorings of distance graphs with distance sets of cardinality $2$