Separator orders in interval, cocomparability, and AT-free graphs

DOI10.1016/j.dam.2011.01.014zbMath1223.05149OpenAlexW1980213624MaRDI QIDQ534331

Jonathan Backer

Publication date: 17 May 2011

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

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

zbMATH Keywords

graphpartial orderminimal separator

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting clique trees and computing perfect elimination schemes in parallel
• Treewidth. Computations and approximations
• Characterizations and algorithmic applications of chordal graph embeddings
• Separability generalizes Dirac's theorem
• A characterisation of rigid circuit graphs
• Algorithmic graph theory and perfect graphs
• Triangulating graphs without asteroidal triples
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• Representations of chordal graphs as subtrees of a tree
• Topics in Intersection Graph Theory
• Independent Sets in Asteroidal Triple-Free Graphs
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Asteroidal Triple-Free Graphs
• Listing all Minimal Separators of a Graph
• How to use the minimal separators of a graph for its chordal triangulation
• Transitiv orientierbare Graphen
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Separator orders in interval, cocomparability, and AT-free graphs