4 papers
On -packing total colorings
Jasmina Ferme, Jaka Hedžet, Petra Melicharova +1
In this paper, we generalize the concept of packing total coloring by introducing a new concept called the -packing total coloring. For a graph and a non-decreasing sequence…
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…
Bootstrap percolation and -hull number in direct products of graphs
Boštjan Brešar, Jaka Hedžet, Rebekah Herrman
The -neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with infected neighbors becomes infected. We say that an initial…
Spreading in graphs
Boštjan Brešar, Tanja Dravec, Aysel Erey +1
Several concepts that model processes of spreading (of information, disease, objects, etc.) in graphs or networks have been studied. In many contexts, we assume that some vertices…