Triangulating multitolerance graphs
type: Item
instance of: scholarly article
title: Triangulating multitolerance graphs
zbMATH Open document ID: 0908.05067
DOI: 10.1016/S0166-218X(98)00026-2
author: Andreas Parra
published in: Discrete Applied Mathematics
publication date: 1998-07-28T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 1180362
zbMATH Keywords: tolerance graph
zbMATH Keywords: trapezoid graphs
zbMATH Keywords: multitolerance graph
zbMATH Keywords: fill-in problem
zbMATH Keywords: treewidth
zbMATH Keywords: pathwidth
MaRDI profile type: Publication
cites work: On a problem concerning tolerance graphs
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Easy problems for tree-decomposable graphs
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Bipartite tolerance orders
cites work: Q4291429
cites work: Q4694712
cites work: The Pathwidth and Treewidth of Cographs
cites work: Proper and unit tolerance graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Trapezoid graphs and their coloring
cites work: Q4281627
cites work: Q5514188
cites work: Q3328583
cites work: Q3322150
cites work: Tolerance graphs
cites work: On some complexity properties of N-free posets and posets with bounded decomposition diameter
cites work: Treewidth of cocomparability graphs and a new order-theoretic parameter
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: TREEWIDTH OF CIRCLE GRAPHS
cites work: Q3138973
cites work: Q4918387
cites work: Q3477966
cites work: Triangulating graphs without asteroidal triples
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Triangulated graphs and the elimination process
cites work: Q4734768
cites work: Bipartite permutation graphs
cites work: Decomposition by clique separators
cites work: Computing the Minimum Fill-In is NP-Complete
description: scientific article; zbMATH DE number 1180362