Branchwidth of chordal graphs
type: Item
instance of: scholarly article
title: Branchwidth of chordal graphs
zbMATH Open document ID: 1211.05167
author: Christophe Paul
author: Jan Arne Telle
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5702587
zbMATH Keywords: graph decomposition
zbMATH Keywords: width parameter
zbMATH Keywords: algorithms
zbMATH Keywords: graphs classes
zbMATH Keywords: k-troika
zbMATH Keywords: edge contraction
zbMATH Keywords: clique tree
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.006
OpenAlex ID: W1965297892
cites work: Constructive linear time algorithms for branchwidth
cites work: Graphs with Branchwidth at Most Three
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Tour merging via branch-decomposition
cites work: Q4449223
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4471291
cites work: STACS 2004
cites work: Automata, Languages and Programming
cites work: Q3328583
cites work: Q4251049
cites work: Computing the branchwidth of interval graphs
cites work: Algorithms – ESA 2005
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Call routing and the ratcatcher
DOI: 10.1016/J.DAM.2008.08.006
description: scientific article; zbMATH DE number 5702587