The following pages link to (Q5743476):
Displaying 8 items.
- On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (Q3612594) (← links)
- Odd Hole Recognition in Graphs of Bounded Clique Size (Q5470814) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
