( en | de | ru )

 

Disambiguation of "Roshanbin, Elham"

Author of the publication

copydeleteadd this publication to your clipboard
Burning a graph is hard.

, , , , and . Discret. Appl. Math., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elham Rostamian

Elham Farvili

Elham Farazdaghi

Huschang Elhami

Sassani Elham

 

Other publications of authors with the same name

The Competitive Diffusion Game in Classes of Graphs.. AAIM, volume 8546 of Lecture Notes in Computer Science, page 275-287. Springer, (2014)A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees., , and . Electron. J. Comb., 28 (1): 1 (2021)Burning a graph is hard., , , , and . Discret. Appl. Math., (2017)How to Burn a Graph., , and . Internet Math., 12 (1-2): 85-100 (2016)Burning number of graph products., , and . Theor. Comput. Sci., (2018)Burning graphs - a probabilistic perspective., , and . CoRR, (2015)Burning Graphs: A Probabilistic Perspective., , and . Graphs Comb., 33 (2): 449-471 (2017)Bounds on the burning number., , , , and . Discret. Appl. Math., (2018)Burning a Graph as a Model of Social Contagion., , and . WAW, volume 8882 of Lecture Notes in Computer Science, page 13-22. Springer, (2014)