Triangulating graphs without asteroidal triples
type: Item
instance of: scholarly article
title: Triangulating graphs without asteroidal triples
zbMATH Open document ID: 0856.68112
DOI: 10.1016/0166-218X(95)00095-9
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 897368
zbMATH Keywords: asteroidal triple
zbMATH Keywords: treewidth
author: Rolf H. Möhring
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Q4035355
cites work: Q4291429
cites work: Q4694712
cites work: Treewidth and pathwidth of permutation graphs
cites work: The Pathwidth and Treewidth of Cographs
cites work: Asteroidal Triple-Free Graphs
cites work: Q3328583
cites work: Tolerance graphs
cites work: On the pathwidth of chordal graphs
cites work: Treewidth of cocomparability graphs and a new order-theoretic parameter
cites work: Treewidth. Computations and approximations
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Q3477966
cites work: Q4859913
cites work: Triangulated graphs and the elimination process
cites work: Q3197842
cites work: Decomposition by clique separators
cites work: Computing the Minimum Fill-In is NP-Complete
full work available at URL: 0166-218x(95)00095-9
OpenAlex ID: W2045187717
description: scientific article; zbMATH DE number 897368