Graphs of Linear Growth have Bounded Treewidth

被引：0

作者：

Campbell, Rutger ^{[1
]}

Distel, Marc ^{[2
]}

Gollin, J. Pascal ^{[1
]}

Harvey, Daniel J.

Hendrey, Kevin ^{[1
]}

Hickingbotham, Robert ^{[2
]}

Mohar, Bojan ^{[3
]}

Wood, David R. ^{[2
]}

机构：

[1] Inst Basic Sci IBS, Discrete Math Grp, Daejeon, South Korea

[2] Monash Univ, Sch Math, Melbourne, Australia

[3] Simon Fraser Univ, Dept Math, Burnaby, BC, Canada

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2023年 / 30卷 / 03期

基金：

加拿大自然科学与工程研究理事会; 澳大利亚研究理事会;

关键词：

POLYNOMIAL-GROWTH; PLANAR GRAPHS; MINORS;

D O I：

10.37236/11657

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A graph class g has linear growth if, for each graph G E g and every positive integer r, every subgraph of G with radius at most r contains O(r) vertices. In this paper, we show that every graph class with linear growth has bounded treewidth.

引用

页数：12

共 50 条

[1] On bounded treewidth duality of graphs
Nesetril, J
Zhu, XD
JOURNAL OF GRAPH THEORY, 1996, 23 (02) : 151 - 162
[2] Trimming weighted graphs of bounded treewidth
Knipe, David
DISCRETE APPLIED MATHEMATICS, 2012, 160 (06) : 902 - 912
[3] Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Bonamy, Marthe
Bonnet, Edouard
Depres, Hugues
Esperet, Louis
Geniet, Colin
Hilaire, Claire
Thomasse, Stephan
Wesolek, Alexandra
PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 3006 - 3028
[4] Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Bonamy, Marthe
Bonnet, Edouard
Depres, Hugues
Esperet, Louis
Geniet, Colin
Hilaire, Claire
Thomasse, Stephan
Wesolek, Alexandra
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 167 : 215 - 249
[5] Waypoint routing on bounded treewidth graphs
Schierreich, Simon
Suchy, Ondrej
INFORMATION PROCESSING LETTERS, 2022, 173
[6] Combinatorial optimization on graphs of bounded treewidth
Bodlaender, Hans L.
Koster, Arie M. C. A.
COMPUTER JOURNAL, 2008, 51 (03): : 255 - 269
[7] Replica Placement on Bounded Treewidth Graphs
Aggarwal, Anshul
Chakaravarthy, Venkatesan T.
Gupta, Neelima
Sabharwal, Yogish
Sharma, Sachin
Thakral, Sonika
ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 13 - 24
[8] Coresets for Clustering in Graphs of Bounded Treewidth
Baker, Daniel
Braverman, Vladimir
Huang, Lingxiao
Jiang, Shaofeng H-C
Krauthgamer, Robert
Wu, Xuan
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
[9] Dynamic algorithms for graphs of bounded treewidth
Hagerup, T
ALGORITHMICA, 2000, 27 (3-4) : 292 - 315
[10] Dynamic Algorithms for Graphs of Bounded Treewidth
T. Hagerup
Algorithmica, 2000, 27 : 292 - 315

← 1 2 3 4 5 →