Minimum tree decompositions with a given tree as a factor
| dc.contributor.author | Lladó, Anna | |
| dc.contributor.author | López Masip, Susana-Clara | |
| dc.date.accessioned | 2021-05-13T09:59:50Z | |
| dc.date.available | 2021-05-13T09:59:50Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | 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. | ca_ES |
| dc.description.sponsorship | 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 | ca_ES |
| dc.identifier.idgrec | 028469 | |
| dc.identifier.issn | 2202-3518 | |
| dc.identifier.uri | http://hdl.handle.net/10459.1/71267 | |
| dc.language.iso | eng | ca_ES |
| dc.publisher | Combinatorial Mathematics Society of Australasia | ca_ES |
| dc.relation.isformatof | Reproducció del document publicat a: https://ajc.maths.uq.edu.au/pdf/31/ajc_v31_p047.pdf | ca_ES |
| dc.relation.ispartof | The Australasian Journal of Combinatorics, 2005, vol. 31, p. 47-59 | ca_ES |
| dc.rights | cc-by-nd, (c) Lladó et al., 2005 | ca_ES |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_ES |
| dc.rights.uri | http://creativecommons.org/licenses/by-nd/4.0/ | * |
| dc.subject | Graphs | ca_ES |
| dc.subject | Tree decomposition | ca_ES |
| dc.title | Minimum tree decompositions with a given tree as a factor | ca_ES |
| dc.type | info:eu-repo/semantics/article | ca_ES |
| dc.type.version | info:eu-repo/semantics/publishedVersion | ca_ES |