Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- A note on odd/even cycles
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for weakly triangulated graphs
- On Comparability and Permutation Graphs
- On rigid circuit graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Topics on perfect graphs
- Weakly triangulated graphs
- `` Strong NP-Completeness Results
Cited in
(13)- Maximum weight independent sets in hole- and co-chair-free graphs
- A Dirac-type characterization of \(k\)-chordal graphs
- Strong cliques in diamond-free graphs
- Hole and antihole detection in graphs
- Detecting holes and antiholes in graphs
- Disjoint clique cutsets in graphs without long holes
- Maximum weight independent sets in hole- and dart-free graphs
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Some problems on induced subgraphs
- Algorithms for weakly triangulated graphs
- On stable cutsets in graphs
- Detecting an Odd Hole
This page was built for publication: Finding large holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182105)
