Pages that link to "Item:Q2944551"
From MaRDI portal
The following pages link to Improved algorithms for weakly chordal graphs (Q2944551):
Displayed 15 items.
- The cluster deletion problem for cographs (Q394219) (← 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)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Mock threshold graphs (Q1637131) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Linear layouts of weakly triangulated graphs (Q2821101) (← links)
- A Characterization of b-Perfect Graphs (Q2911056) (← links)
- A separator-based method for generating weakly chordal graphs (Q5858151) (← links)
- Generating weakly chordal graphs from arbitrary graphs (Q6111462) (← links)