BROWSE

Related Scientist

campbell,rutger's photo.

campbell,rutger
이산수학그룹
more info

ITEM VIEW & DOWNLOAD

Graphs of Linear Growth have Bounded Treewidth

Cited 0 time in webofscience Cited 0 time in scopus
55 Viewed 0 Downloaded
Title
Graphs of Linear Growth have Bounded Treewidth
Author(s)
Rutger Campbell; Distel, Marc; J. Pascal Gollin; Harvey, Daniel J.; Kevin Hendrey; Hickingbotham, Robert; Mohar, Bojan; Wood, David R.
Publication Date
2023-07
Journal
Electronic Journal of Combinatorics, v.30, no.3
Publisher
Australian National University
Abstract
A graph class G has linear growth if, for each graph G ∈ 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. Mathematics Subject Classifications: 05C83, 05C62. © The authors.
URI
https://pr.ibs.re.kr/handle/8788114/14636
DOI
10.37236/11657
ISSN
1077-8926
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse