Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496)
From MaRDI portal
 | 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: Equivalent definitions of recognizability for sets of graphs of bounded tree-width |
scientific article; zbMATH DE number 890019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalent definitions of recognizability for sets of graphs of bounded tree-width |
scientific article; zbMATH DE number 890019 |
Statements
Equivalent definitions of recognizability for sets of graphs of bounded tree-width (English)
0 references
12 September 1996
0 references
finite graphs
0 references
tree-width
0 references
0.944226324558258
0 references
0.8574971556663513
0 references
0.8019147515296936
0 references
0.8016559481620789
0 references
