On the number of labeled graphs of bounded treewidth
type: Item
instance of: scholarly article
title: On the number of labeled graphs of bounded treewidth
zbMATH Open document ID: 1486.05292
zbMATH Open document ID: 1387.05114
DOI: 10.1007/978-3-319-68705-6_7
DOI: 10.1016/J.EJC.2018.02.030
author: Julien Baste
author: Marc Noy
author: Ignasi Sau
published in: Graph-Theoretic Concepts in Computer Science
published in: European Journal of Combinatorics
publication date: 2018-01-04T00:00:00Z
publication date: 2018-05-18T00:00:00Z
full work available at URL: https://arxiv.org/abs/1604.07273
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 6821991
zbMATH DE Number: 6870114
zbMATH Keywords: treewidth
zbMATH Keywords: partial \(k\)-trees
zbMATH Keywords: enumeration
zbMATH Keywords: pathwidth
zbMATH Keywords: proper-pathwidth
zbMATH Keywords: labeled \(k\)-trees
MaRDI profile type: Publication
OpenAlex ID: W2963386661
OpenAlex ID: W2790333339
arXiv ID: 1604.07273
cites work: The number of labeled k-dimensional trees
cites work: Enumeration and limit laws for series-parallel graphs
cites work: Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
cites work: Subexponential Time Algorithms for Embedding H-Minor Free Graphs
cites work: Parameterized Algorithms
cites work: An asymptotic analysis of labeled and unlabeled \(k\)-trees
cites work: Q3549563
cites work: Enumerating k-trees
cites work: \(\Gamma \)-species and the enumeration of \(k\)-trees
cites work: Counting unlabeled \(k\)-trees
cites work: Kernelization using structural parameters on sparse graph classes
cites work: Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
cites work: A Near-Optimal Planarization Algorithm
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Treewidth. Computations and approximations
cites work: On the treewidth and related parameters of random geometric graphs
cites work: The number of labeled k-trees
cites work: On random planar graphs, the number of planar graphs and their triangulations
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: On the Number of Distinct Forests
cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width
cites work: Mixed searching and proper-path-width
Wikidata QID: Q130173040
description: scientific article; zbMATH DE number 6870114