On the Number of Labeled Graphs of Bounded Treewidth
Résumé
Let $T_n,_k$ be the number of labeled graphs on $n$ vertices and treewidth at most $k$ (equivalently, the number of labeled partial $k$-trees). We show that…
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|