On the number of labeled graphs of bounded treewidth (Q5915790)
From MaRDI portal
(Redirected from Item:Q5916052)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of labeled graphs of bounded treewidth |
scientific article; zbMATH DE number 6870114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of labeled graphs of bounded treewidth |
scientific article; zbMATH DE number 6870114 |
Statements
On the number of labeled graphs of bounded treewidth (English)
0 references
4 January 2018
0 references
18 May 2018
0 references
treewidth
0 references
partial \(k\)-trees
0 references
enumeration
0 references
pathwidth
0 references
proper-pathwidth
0 references
labeled \(k\)-trees
0 references
0 references
0.9994054436683656
0 references
0.7664852142333984
0 references
0.7575708627700806
0 references
