167 citations · 213 across the 9 of their papers we have counts for
22 papers · 1 filter
Claw-free cubic graphs are -colorable
Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall
A -coloring of a graph is a partition of its vertex set into four sets two of which are independent and the other two are -packings. In this paper, we prove that ever…
Isolation game on graphs
Boštjan Brešar, Tanja Dravec, Daniel P. Johnston +2
Given a graph and a family of graphs , an -isolating set, as introduced by Caro and Hansberg, is any set such that contains no member…
Injective colorings of Sierpiński-like graphs and Kneser graphs
Boštjan Brešar, Sandi Klavžar, Babak Samadi +1
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic…
Orientable domination in product-like graphs
Sarah Anderson, Boštjan Brešar, Sandi Klavžar +2
The orientable domination number, , of a graph is the largest domination number over all orientations of . In this paper, is studied on different p…
The independence coloring game on graphs
Boštjan Brešar, Daša Štesl
We propose a new coloring game on a graph, called the independence coloring game, which is played by two players with opposite goals. The result of the game is a proper coloring of…
The geodesic-transversal problem
Paul Manuel, Boštjan Brešar, Sandi Klavžar
A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph is introduced as the…