DeepAI AI Chat
Log In Sign Up

On the Burning Number of p-Caterpillars

by   Michaela Hiller, et al.

The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessary numbers of time steps until all vertices are reached is proven for some specific graph classes it remains open for trees in general. We present two different proofs for ordinary caterpillars and prove the conjecture for a generalised version of caterpillars and for trees with a sufficient amount of leaves. Furthermore, determining the burning number for spider graphs, trees with maximum degree three and path-forests is known to be NP-complete, however, we show that the complexity is already inherent in caterpillars with maximum degree three.


page 1

page 2

page 3

page 4


NP-completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim of the graph burning ...

Burning Geometric Graphs

A procedure called graph burning was introduced to facilitate the modell...

Towards the linear arboricity conjecture

The linear arboricity of a graph G, denoted by la(G), is the minimum num...

Pushable chromatic number of graphs with degree constraints

Pushable homomorphisms and the pushable chromatic number χ_p of oriented...

New heuristics for burning graphs

The concept of graph burning and burning number (bn(G)) of a graph G was...

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints

We consider acyclic r-colorings in graphs and digraphs: they color the v...

Complete combinatorial characterization of greedy-drawable trees

A (Euclidean) greedy drawing of a graph is a drawing in which, for any t...