Computing the tree number of a cut-outerplanar graph

Abstract

While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tree number of a graph.

arXiv commentThese results are not incorrect but are covered in other works