Separator orders in interval, cocomparability, and AT-free graphs
type: Item
instance of: scholarly article
title: Separator orders in interval, cocomparability, and AT-free graphs
zbMATH Open document ID: 1223.05149
author: Jonathan Backer
published in: Discrete Applied Mathematics
publication date: 2011-05-17T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5895532
zbMATH Keywords: graph
zbMATH Keywords: minimal separator
zbMATH Keywords: partial order
MaRDI profile type: Publication
full work available at URL: j.dam.2011.01.014
OpenAlex ID: W1980213624
cites work: Separability generalizes Dirac's theorem
cites work: Q4288578
cites work: Independent Sets in Asteroidal Triple-Free Graphs
cites work: A characterisation of rigid circuit graphs
cites work: Q4511223
cites work: Asteroidal Triple-Free Graphs
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: Q4044621
cites work: Incidence matrices and interval graphs
cites work: Transitiv orientierbare Graphen
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
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: Algorithmic graph theory and perfect graphs
cites work: Counting clique trees and computing perfect elimination schemes in parallel
cites work: Listing all Minimal Separators of a Graph
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
cites work: Topics in Intersection Graph Theory
cites work: Triangulating graphs without asteroidal triples
cites work: How to use the minimal separators of a graph for its chordal triangulation
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Representations of chordal graphs as subtrees of a tree
cites work: Treewidth. Computations and approximations
DOI: 10.1016/J.DAM.2011.01.014
description: scientific article; zbMATH DE number 5895532