Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
type: Item
instance of: scholarly article
title: Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
zbMATH Open document ID: 1239.05166
author: Yong Gao
published in: Discrete Applied Mathematics
publication date: 2012-05-04T00:00:00Z
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6030395
zbMATH Keywords: treewidth
zbMATH Keywords: random graphs
zbMATH Keywords: random intersection graphs
zbMATH Keywords: scale-free random graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2011.10.013
OpenAlex ID: W2080300451
cites work: Q4705349
cites work: Statistical mechanics of complex networks
cites work: Coloring Random Intersection Graphs and Complex Networks
cites work: The mixing time of the giant component of a random graph
cites work: Q4291429
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Paths in graphs
cites work: The degree sequence of a scale-free random graph process
cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
cites work: On the satisfiability threshold of formulas with three literals per clause
cites work: Q3286850
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: On the Threshold of Having a Linear Treewidth in Random Graphs
cites work: On tree width, bramble size, and expansion
cites work: On Random Intersection Graphs: The Subgraph Problem
cites work: Approximating the unsatisfiability threshold of random formulas
cites work: Treewidth. Computations and approximations
cites work: Rank-width of random graphs
cites work: Q3496342
cites work: Graph minors. II. Algorithmic aspects of tree-width
DOI: 10.1016/J.DAM.2011.10.013
description: scientific article; zbMATH DE number 6030395