Before revision:  More precisely, we show burning problem to be NP-complete on interval graph, permutation graph and disk graph .
After revision:  More precisely, we show burning problem to be NP-Complete on connected interval graphs, permutation graphs and several other geometric graph classes as corollaries .