Pages that link to "Item:Q870455"
From MaRDI portal
The following pages link to Detecting holes and antiholes in graphs (Q870455):
Displaying 11 items.
- Finding large holes (Q1182105) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Forbidding holes and antiholes (Q2758335) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Detecting an Odd Hole (Q5133961) (← links)
- Odd Hole Recognition in Graphs of Bounded Clique Size (Q5470814) (← links)
- (Q5743476) (← links)
- Quasimonotone graphs (Q5918199) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)