Graphs of linear growth have bounded treewidth (Q6115513): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Growth and percolation on the uniform infinite planar triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of 1-planar graphs is constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four pages are indeed necessary for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack-number is not bounded by queue-number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of graphs with balanced separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar graphs of uniform polynomial growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pagenumber of \(k\)-trees is \(O(k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on bounded automorphisms of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with polynomial growth are covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems related to growth, entropy, and spectrum in group theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups of polynomial growth and expanding maps. Appendix by Jacques Tits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for groups of linear growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the growth of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on graphs with polynomial growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intrinsic dimensionality of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical aspects of Cayley-graphs: the group case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-degree graph expansions that preserve treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of finitely generated solvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of finitely generated solvable groups and curvature of Riemannian manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs that need four pages / rank
 
Normal rank

Latest revision as of 14:10, 2 August 2024

scientific article; zbMATH DE number 7725117
Language Label Description Also known as
English
Graphs of linear growth have bounded treewidth
scientific article; zbMATH DE number 7725117

    Statements

    Graphs of linear growth have bounded treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2023
    0 references
    Summary: A graph class \(\mathcal{G}\) has linear growth if, for each graph \(G \in \mathcal{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.
    0 references
    0 references
    tree-decomposition of a graph
    0 references
    \(k\)-stack layout
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references