Every graph is the edge intersection graph of subtrees of a tree. The tree-degree of a graph is the minimum maximal degree of the underlying tree for which there exists a subtree intersection model. Computing the tree-degree is NP-complete even for planar graphs, but polynomial time algorithms exist for outer-planar graphs, diamond-free graphs and chordal graphs. The number of minimal separators of graphs with bounded tree-degree is polynomial. This implies that the treewidth of graphs with bounded tree-degree can be computed efficiently, even without the model given in advance.
CITATION STYLE
Chang, M. S., & Müller, H. (2001). On the tree-degree of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2204, pp. 44–54). Springer Verlag. https://doi.org/10.1007/3-540-45477-2_6
Mendeley helps you to discover research relevant for your work.