167 citations · 218 across the 30 of their papers we have counts for
8 papers · 2 filters
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…
Induced matching vs edge open packing: trees and product graphs
Bostjan Bresar, Tanja Dravec, Jaka Hedzet +1
Given a graph , the maximum size of an induced subgraph of each component of which is a star is called the edge open packing number, , of . Similarly, the m…
-packing colorings of distance graphs with distance sets of cardinality
Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2
For a non-decreasing sequence of positive integers, a partition of the vertex set of a graph into subsets , such that vertices in …
Best possible upper bounds on the restrained domination number of cubic graphs
Boštjan Brešar, Michael A. Henning
A dominating set in a graph is a set of vertices such that every vertex in is adjacent to a vertex in . A restrained dominating set of is a domina…