Edge-Maximal Graphs of Branchwidth $k$

Christophe Paul; Jan Arne Telle

doi:10.1016/j.endm.2005.06.075

Back

Journal article

Peer reviewed

Edge-Maximal Graphs of Branchwidth $k$

Christophe Paul and Jan Arne Telle

Electronic Notes in Discrete Mathematics, Vol.22(7th International Colloquium on Graph Theory), pp.363-368

10/2005

DOI: https://doi.org/10.1016/j.endm.2005.06.075

Abstract

In this extended abstract we state some definitions and results from our earlier paper [C.Paul and J.A.Telle. New tools and simpler algorithms for branchwidth. In European Symposium on Algorithm - ESA 2005. To appear in Lecture Notes in Computer Science, 2005. Full draft avalaible as LIRMM RR 05-017] and use these to characterize the class of edge-maximal graphs of branchwidth k. Similarly to the maximal graphs of treewidth k (the k-trees) they turn out to be a subclass of chordal graphs where every minimal separator has size k.

Files and links (1)

url

Find in HALView

Metrics

1 Record Views

Details

Title: Edge-Maximal Graphs of Branchwidth $k$
Creators - without role: Christophe Paul - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Jan Arne Telle - University of Bergen
Publication Details: Electronic Notes in Discrete Mathematics, Vol.22(7th International Colloquium on Graph Theory), pp.363-368
Identifiers: 9946174609311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-00106051