Recognizing weakly triangulated graphs by edge separability
From MaRDI portal
Recommendations
Cited in
(24)- Graph extremities defined by search algorithms
- Minimal separators in extended \(P_4\)-laden graphs
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- Chordal probe graphs
- Algorithms for weakly triangulated graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Representing edge intersection graphs of paths on degree 4 trees
- Maximal sub-triangulation in pre-processing phylogenetic data
- scientific article; zbMATH DE number 1617254 (Why is no real title available?)
- Linear layouts of weakly triangulated graphs
- Recognizing cographs and threshold graphs through a classification of their edges
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- Weakly Triangulated Comparability Graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Recognizing Weak Embeddings of Graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- What Is between Chordal and Weakly Chordal Graphs?
- Linear layouts of weakly triangulated graphs
- Generating weakly chordal graphs from arbitrary graphs
- Verification of a certificate for weakly chordal graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- A vertex incremental approach for maintaining chordality
This page was built for publication: Recognizing weakly triangulated graphs by edge separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708230)
