The following pages link to Finding large holes (Q1182105):
Displayed 10 items.
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)