Skip to content

Author

Marko Jakovac

We have 5 of 8 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Frugal coloring in planar graphs with maximum degree 4 and 5

A proper coloring of vertices of a graph $G$ is called $t$-frugal if no color appears more than $t$ times in the neighborhood of any vertex of $G$. While $1$-frugal coloring coincides with $2$-distance coloring, we study $2$-frugal colorings of planar graphs with maximum degree $4$ and $5$, respectively. We prove that...

B. Brešar, Přemysl Holub, Marko Jakovac et al. · 0 citations
Preprint Sep 2026

On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products

We continue research on the burning game on graphs. Given a graph $G$, two players, Burner and Staller, take turns in selecting vertices of $G$ to burn. All burned vertices spread fire to unburned neighboring vertices, as in the burning process. The goal of Burner is to burn the graph as quickly as possible, while Stal...

Nina Chiarelli, Vesna Irvsivc Chenoweth, Marko Jakovac et al. · 0 citations
Preprint Sep 2026

A variety of the mutual-visibility coloring problem for graphs

This paper explores variations of vertex-coloring problems defined on graph visibility properties. It introduces and studies the dual, outer, and total mutual-visibility chromatic numbers, which partition the vertex set of a graph into color classes that preserve specific mutual-visibility conditions called dual, outer...

Saneesh Babu, Marko Jakovac, D. Kuziak et al. · 0 citations
Preprint Sep 2026

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

The total domination number $\gamma_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 number $a(G)$ is the largest integer $k$ for which the sum of the $k$ smallest degrees of $G$ is at most $|E(G)|$. A well-known conjecture,...

Marko Jakovac · 0 citations
Preprint Sep 2026

Sequence b-colorings in graphs

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-coloring, each color class is required to contain a prescribed minimum number of color-dominating vertices (CDVs). We establish several fund...

Marko Jakovac, Michael S. Lang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.