Pages that link to "Item:Q2708230"
From MaRDI portal
The following pages link to Recognizing weakly triangulated graphs by edge separability (Q2708230):
Displaying 18 items.
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam (Q1814095) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Recognizing Weak Embeddings of Graphs (Q4973046) (← links)
- What Is between Chordal and Weakly Chordal Graphs? (Q5302062) (← links)
