Edge-maximal graphs of branchwidth k

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 363-368

  Paul, Christophe ^a   Telle, Jan Arne ^b  

^a LIRMM   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Graph; Tree decomposition; Width parameters

Indexed keywords

EID: 33845521319     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.075     Document Type: Article

References (4)

1. Bodlaender H.L., and Thilikos D.M. Graphs with branchwidth at most three. Journal of Algorithms 32 (1999) 167-194
2. 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
3. Robertson N., and Seymour P.D. Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B 52 (1991) 153-190
4. Rose D. On simple characterization of k-trees. Discrete Mathematics 7 (1974) 317-322