On the number of labeled graphs of bounded treewidth

Journal article

Open access

Peer reviewed

Julien Baste, Marc Noy and Ignasi Sau

European Journal of Combinatorics, Vol.71, pp.12-21

2018

Abstract

treewidth

partial k-trees

enumeration

pathwidth

properpathwidth

url

Find in HALView

url

https://doi.org/10.1016/j.ejc.2018.02.030View

Published (Version of record) Open

1 Record Views

Title: On the number of labeled graphs of bounded treewidth
Creators - without role: Julien Baste - Algorithmes, Graphes et Combinatoire
Marc Noy - Universitat Politècnica de Catalunya
Ignasi Sau - Universidade Federal do Ceará
Publication Details: European Journal of Combinatorics, Vol.71, pp.12-21
Identifiers: 9942935209311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: hal-03109959