On the treewidth of random geometric graphs and percolated grids
From MaRDI portal
Publication:5233158
DOI10.1017/apr.2016.78zbMath1428.05284OpenAlexW2595084498MaRDI QIDQ5233158
Publication date: 16 September 2019
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/apr.2016.78
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Percolation (82B43)
Related Items (4)
Treewidth of the generalized Kneser graphs ⋮ Treewidth of the \(q\)-Kneser graphs ⋮ On the tree-depth and tree-width in heterogeneous random graphs ⋮ On Treewidth and Related Parameters of Random Geometric Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton cycles in random geometric graphs
- On the chromatic number of random geometric graphs
- Analyticity properties and power law estimates of functions in percolation theory
- The critical probability of bond percolation on the square lattice equals 1/2
- S-functions for graphs
- Treewidth. Computations and approximations
- Domination by product measures
- The longest edge of the random minimal spanning tree
- Two-point concentration in random geometric graphs
- Monotone properties of random geometric graphs have sharp thresholds
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The cover time of random geometric graphs
- Disjoint Hamilton cycles in the random geometric graph
- Percolation
- Graph minors. II. Algorithmic aspects of tree-width
- Random Plane Networks
- A Separator Theorem for Nonplanar Graphs
- Percolation
- Random Geometric Graphs
- Random channel assignment in the plane
This page was built for publication: On the treewidth of random geometric graphs and percolated grids