Separator orders in interval, cocomparability, and AT-free graphs
From MaRDI portal
Publication:534331
DOI10.1016/J.DAM.2011.01.014zbMATH Open1223.05149OpenAlexW1980213624MaRDI QIDQ534331FDOQ534331
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Algorithmic graph theory and perfect graphs
- 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
- Representations of chordal graphs as subtrees of a tree
- Transitiv orientierbare Graphen
- A Characterization of Comparability Graphs and of Interval Graphs
- Treewidth. Computations and approximations
- Asteroidal Triple-Free Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- Listing all Minimal Separators of a Graph
- Independent Sets in Asteroidal Triple-Free Graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Characterizations and algorithmic applications of chordal graph embeddings
- A characterisation of rigid circuit graphs
- Triangulating graphs without asteroidal triples
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Separability generalizes Dirac's theorem
- How to use the minimal separators of a graph for its chordal triangulation
Cited In (3)
This page was built for publication: Separator orders in interval, cocomparability, and AT-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534331)
