On the Number of Labeled Graphs of Bounded Treewidth

Julien Baste; Marc Noy; Ignasi Sau

doi:10.1007/978-3-319-68705-6_7

Retour

On the Number of Labeled Graphs of Bounded Treewidth

Acte de colloque

Open Access

On the Number of Labeled Graphs of Bounded Treewidth

Julien Baste, Marc Noy et Ignasi Sau

Graph-Theoretic Concepts in Computer Science43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, Vol.10520, pp.88-99

Lecture Notes in Computer Science

WG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (Eindhoven, Netherlands, 21/06/2017–23/06/2017)

2017

DOI: https://doi.org/10.1007/978-3-319-68705-6_7

Résumé

Treewidth

Partial k-trees

Enumeration

Pathwidth

Proper-pathwidth

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…

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: On the Number of Labeled Graphs of Bounded Treewidth
Créateurs - sans rôle: Julien Baste - Université de Montpellier
Marc Noy - Universitat Politècnica de Catalunya
Ignasi Sau - Universidade Federal do Ceará
Détails de publication: Graph-Theoretic Concepts in Computer Science43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, Vol.10520, pp.88-99
Colloque: WG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (Eindhoven, Netherlands, 21/06/2017–23/06/2017)
Publications en série: Lecture Notes in Computer Science
Identifiants: 9944647809311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: hal-01734085