Treewidth of graphs with balanced separations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10401425" target="_blank" >RIV/00216208:11320/19:10401425 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ax6ERS6dlE" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ax6ERS6dlE</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2018.12.007" target="_blank" >10.1016/j.jctb.2018.12.007</a>
Alternative languages
Result language
angličtina
Original language name
Treewidth of graphs with balanced separations
Original language description
We prove that if every subgraph of a graph G has a balanced separation of order at most a then G has treewidth at most 15a. This establishes a linear dependence between the treewidth and the separation number. (C) 2018 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
137
Issue of the periodical within the volume
July
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
137-144
UT code for WoS article
000467196400010
EID of the result in the Scopus database
2-s2.0-85058706421