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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2005 |
| País: | España |
| Institución: | Universitat de Lleida (UdL) |
| Repositorio: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/71267 |
| Acceso en línea: | http://hdl.handle.net/10459.1/71267 |
| Access Level: | acceso abierto |
| Palabra clave: | Graphs Tree decomposition |
| Sumario: | 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. |
|---|