Edge-Maximal Graphs of Branchwidth $k$ - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2005

Edge-Maximal Graphs of Branchwidth $k$

Christophe Paul
Jan Arne Telle
  • Function : Author
  • PersonId : 889063

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.

Dates and versions

lirmm-00106051 , version 1 (13-10-2006)

Identifiers

Cite

Christophe Paul, Jan Arne Telle. Edge-Maximal Graphs of Branchwidth $k$. Electronic Notes in Discrete Mathematics, 2005, 22 (7th International Colloquium on Graph Theory), pp.363-368. ⟨10.1016/j.endm.2005.06.075⟩. ⟨lirmm-00106051⟩
63 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More