UP - logo
University of Primorska University Library - all departments (UPUK)
  • On tree decompositions whose trees are minors
    Blanco, Pablo, matematik ...
    In 2019, Dvořák asked whether every connected graph G has a tree decomposition (T,B) so that T is a subgraph of G and the width (T,B) of is bounded by a function of the treewidth of G. We prove that ... this is false, even when G has treewidth 2 and T is allowed to be a minor of G.
    Source: Journal of graph theory. - ISSN 0364-9024 (Vol. 106, iss. 2, 2024, str. 296-306)
    Type of material - article, component part ; adult, serious
    Publish date - 2024
    Language - english
    COBISS.SI-ID - 201720579

source: Journal of graph theory. - ISSN 0364-9024 (Vol. 106, iss. 2, 2024, str. 296-306)

loading ...
loading ...
loading ...