167 citations · 330 across the 37 of their papers we have counts for
58 papers
Frugal coloring in planar graphs with maximum degree 4 and 5
Boštjan Brešar, Přemysl Holub, Marko Jakovac +1
A proper coloring of vertices of a graph is called -frugal if no color appears more than times in the neighborhood of any vertex of . While -frugal coloring coinci…
Partitioning an -packing coloring into broadcast dominating sets
Boštjan Brešar, Jasmina Ferme, Wenjie Hu
Given a graph and a positive integer , a packing -domatic coloring of is a function such that (1) for any color a…
On the isolation numbers in graph products
Boštjan Brešar, Douglas F. Rall
As a continuation of a previous study of isolation numbers in Cartesian and lexicographic products, we investigate isolation numbers and, more generally, -isolation numbers…
Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
Saneesh Babu, Boštjan Brešar, Aparna Lakshmanan S +1
The concept of mutual-visibility (MV) has been extended in several directions. A vertex subset of a graph is a -distance mutual-visibility (DMV) set if for any two ve…
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
Boštjan Brešar, María Gracia Cornet, Tanja Dravec
Given a graph a set is called monophonic if every vertex in lies on some induced path between two vertices in . The monophonic number, , of , wh…
Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
Bostjan Bresar, Tanja Dravec, Daniel P. Johnston +3
The isolation number of a graph is the minimum cardinality of a set such that the subgraph induced by the vertices that are not in the union of the close…