Marko Jakovac

Orcid: 0000-0002-4136-7365

According to our database1, Marko Jakovac authored at least 17 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
1
1
2
1
2
1
1
1
2
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
S-packing colorings of distance graphs with distance sets of cardinality 2.
Appl. Math. Comput., 2025

2022
The k-path vertex cover: General bounds and chordal graphs.
Networks, 2022

2021
On the security number of the Cartesian product of graphs.
Discret. Appl. Math., 2021

Indicated coloring game on Cartesian products of graphs.
Discret. Appl. Math., 2021

2020
S-packing chromatic vertex-critical graphs.
Discret. Appl. Math., 2020

2019
Relating the annihilation number and the 2-domination number of block graphs.
Discret. Appl. Math., 2019

Relating the total domination number and the annihilation number of cactus graphs and block graphs.
Ars Math. Contemp., 2019

2018
The b-chromatic number and related topics - A survey.
Discret. Appl. Math., 2018

2016
The security number of strong grid-like graphs.
Theor. Comput. Sci., 2016

2015
The k-path vertex cover of rooted product graphs.
Discret. Appl. Math., 2015

2014
The partition dimension of strong product graphs and Cartesian product graphs.
Discret. Math., 2014

A 2-parametric generalization of Sierpinski gasket graphs.
Ars Comb., 2014

2013
On the k-path vertex cover of some graph products.
Discret. Math., 2013

On the vertex <i>k</i>k-path cover.
Discret. Appl. Math., 2013

2011
On the b-chromatic number of regular graphs.
Discret. Appl. Math., 2011

2010
The b-Chromatic Number of Cubic Graphs.
Graphs Comb., 2010

2009
Vertex-, edge-, and total-colorings of Sierpinski-like graphs.
Discret. Math., 2009


  Loading...