Computing the tree number of a cut-outerplanar graph
Discrete Mathematics
2020-08-03 v2 Data Structures and Algorithms
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.
Cite
@article{arxiv.0906.0422,
title = {Computing the tree number of a cut-outerplanar graph},
author = {Natalia Vanetik},
journal= {arXiv preprint arXiv:0906.0422},
year = {2020}
}
Comments
These results are not incorrect but are covered in other works