Branchwidth of chordal graphs

DOI10.1016/j.dam.2008.08.006zbMath1211.05167OpenAlexW1965297892MaRDI QIDQ967314

Christophe Paul, Jan Arne Telle

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.006

zbMATH Keywords

algorithmsgraph decompositionedge contractionclique treewidth parametergraphs classesk-troika

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

Reduced clique graphs of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Call routing and the ratcatcher
• Computing the branchwidth of interval graphs
• Tour Merging via Branch-Decomposition
• Graphs with Branchwidth at Most Three
• Constructive linear time algorithms for branchwidth
• STACS 2004
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Branchwidth of chordal graphs