Minimum tree decompositions with a given tree as a factor
Minimum tree decompositions with a given tree as a factor
A tree decomposition of a graph G is a family of subtrees whose sets of edges partition the set of edges of G. In this paper we are interested in the structure of the trees involved in tree decompositions with the minimum possible number of factors. We show that arbitrary trees may appear in minimum tree decompositions of maximal planar bipartite graphs, maximal planar graphs and regular graphs.
Supported by the Ministry of Science and Technology of Spain, and the European Regional Devepolment Fund (ERDF) under project TIC-2001-2171. Supported by the Catalan Research Council under grant 2001SGR-00079
- University of Lleida Spain
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Tree decomposition, trees, graph decomposition, Graphs, Trees
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Tree decomposition, trees, graph decomposition, Graphs, Trees
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!