Showing math.COShow all
2 papers · 1 filter
math.CO2018
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…
math.CO2015
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…