Pages that link to "Item:Q1891926"
From MaRDI portal
The following pages link to Algorithms for weakly triangulated graphs (Q1891926):
Displaying 27 items.
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← 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)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
- Linearity defect of edge ideals and Fröberg's theorem (Q737978) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Finding large holes (Q1182105) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Symmetric graph-theoretic roles of two-pairs and chords of cycles (Q2920879) (← links)
- (Q3301019) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Edge erasures and chordal graphs (Q5061692) (← links)
- (Q5708487) (← links)
- A separator-based method for generating weakly chordal graphs (Q5858151) (← links)
