Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
type: Item
instance of: scholarly article
title: Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
zbMATH Open document ID: 1229.05153
author: Christophe Paul
author: Jan Arne Telle
published in: Discrete Mathematics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5565684
zbMATH Keywords: graph decomposition
zbMATH Keywords: chordal
zbMATH Keywords: branchwidth
zbMATH Keywords: edge maximal
MaRDI profile type: Publication
full work available at URL: j.disc.2008.02.030
OpenAlex ID: W2168941338
cites work: Q3758844
cites work: Q4699283
cites work: Graphs with Branchwidth at Most Three
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q4251049
cites work: Edge-maximal graphs of branchwidth k
cites work: Algorithms – ESA 2005
cites work: On simple characterizations of k-trees
cites work: Graph minors. X: Obstructions to tree-decomposition
DOI: 10.1016/J.DISC.2008.02.030
description: scientific article; zbMATH DE number 5565684