3 papers
cs.DS2026
Hardness of Burning Number Problem on Regular Graphs
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as…
math.CO2026
Burning Graph Powers and Branching Trees
Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami +1
Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned…
math.CO2025
Acyclic Edge Coloring of 3-sparse Graphs
Nevil Anto, Manu Basavaraju, Shashanka Kulamarva
A proper edge coloring of a graph without any bichromatic cycles is said to be an acyclic edge coloring of the graph. The acyclic chromatic index of a graph denoted by ,…