Two characterisations of the minimal triangulations of permutation graphs
type: Item
instance of: scholarly article
title: Two characterisations of the minimal triangulations of permutation graphs
zbMATH Open document ID: 1281.05057
author: Daniel Meister
published in: Discrete Mathematics
publication date: 2014-01-23T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6249352
zbMATH Keywords: permutation graphs
zbMATH Keywords: interval graphs
zbMATH Keywords: minimal triangulations
zbMATH Keywords: potential maximal cliques
zbMATH Keywords: characterisations
MaRDI profile type: Publication
full work available at URL: j.disc.2013.06.004
OpenAlex ID: W2077491430
cites work: Q4252378
cites work: Q4288578
cites work: Treewidth and Pathwidth of Permutation Graphs
cites work: The Pathwidth and Treewidth of Cographs
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: Graph Classes: A Survey
cites work: A characterisation of rigid circuit graphs
cites work: On rigid circuit graphs
cites work: Permutation Graphs and Transitive Graphs
cites work: Finding Induced Subgraphs via Minimal Triangulations
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Bandwidth on AT-free graphs
cites work: Q3328583
cites work: Minimal triangulations of graphs: a survey
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs
cites work: On a property of minimal triangulations
cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
cites work: Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
cites work: Treewidth and minimum fill-in on permutation graphs in linear time
cites work: Triangulating graphs without asteroidal triples
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Representations of chordal graphs as subtrees of a tree
DOI: 10.1016/J.DISC.2013.06.004
description: scientific article; zbMATH DE number 6249352