Tree-width dichotomy

Vadim Lozin; Igor Razgon

doi:10.1016/j.ejc.2022.103517

Tree-width dichotomy

Vadim Lozin, Igor Razgon

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

Abstract

We prove that the tree-width of graphs in a hereditary class defined by a finite set F of forbidden induced subgraphs is bounded if and only if F includes a complete graph, a complete bipartite graph, a tripod (a forest in which every connected component has at most 3 leaves) and the line graph of a tripod.

Original language	English
Article number	103517
Journal	European Journal of Combinatorics
Volume	103
DOIs	https://doi.org/10.1016/j.ejc.2022.103517
State	Published - 1 Jun 2022
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.ejc.2022.103517

Cite this

@article{fcd1e7bb8c83498794a390b41a13fc46,

title = "Tree-width dichotomy",

abstract = "We prove that the tree-width of graphs in a hereditary class defined by a finite set F of forbidden induced subgraphs is bounded if and only if F includes a complete graph, a complete bipartite graph, a tripod (a forest in which every connected component has at most 3 leaves) and the line graph of a tripod.",

author = "Vadim Lozin and Igor Razgon",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier Ltd",

year = "2022",

month = jun,

day = "1",

doi = "10.1016/j.ejc.2022.103517",

language = "English",

volume = "103",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - Tree-width dichotomy

AU - Lozin, Vadim

AU - Razgon, Igor

PY - 2022/6/1

Y1 - 2022/6/1

N2 - We prove that the tree-width of graphs in a hereditary class defined by a finite set F of forbidden induced subgraphs is bounded if and only if F includes a complete graph, a complete bipartite graph, a tripod (a forest in which every connected component has at most 3 leaves) and the line graph of a tripod.

AB - We prove that the tree-width of graphs in a hereditary class defined by a finite set F of forbidden induced subgraphs is bounded if and only if F includes a complete graph, a complete bipartite graph, a tripod (a forest in which every connected component has at most 3 leaves) and the line graph of a tripod.

UR - https://www.scopus.com/pages/publications/85124882103

U2 - 10.1016/j.ejc.2022.103517

DO - 10.1016/j.ejc.2022.103517

M3 - Article

AN - SCOPUS:85124882103

SN - 0195-6698

VL - 103

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103517

ER -

Tree-width dichotomy

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this