Computing the tree number of a cut-outerplanar graph

2009/06/02 by Natalia Vanetik, Vanetik, Natalia
Computer Science · #Advanced Graph Theory Research

paper · pdf · doi:10.48550/arxiv.0906.0422

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.

Related

• Computing bounded-width tree and branch decompositions of k-outerplanar\n graphs
• Counting Trees in a Certain Class of Graphs
• Non-branching tree-decompositions
• Edge-Cuts and Rooted Spanning Trees
• Treewidth of Outer k-Planar Graphs