6 citations · 9 across the 2 of their papers we have counts for
5 papers
A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees
Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi
A star edge coloring of a graph is a proper edge coloring of such that every path and cycle of length four in uses at least three different colors. The star chromatic i…
Burning a Graph is Hard
Anthony Bonato, Jeannette Janssen, Elham Roshanbin
Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagio…
Bounds on the Burning Number
Stéphane Bessy, Anthony Bonato, Jeannette Janssen +1
Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Con…
How to burn a graph
Anthony Bonato, Jeannette Janssen, Elham Roshanbin
We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Fir…
Burning graphs - a probabilistic perspective
Dieter Mitsche, Pawel Pralat, Elham Roshanbin
In this paper, we study a graph parameter that was recently introduced, the burning number, focusing on a few probabilistic aspects of the problem. The original burning number is r…