Pages that link to "Item:Q1193442"
From MaRDI portal
The following pages link to Corrigendum to: On the complexity of testing for odd holes and induced odd paths (Q1193442):
Displaying 20 items.
- Clique or hole in claw-free graphs (Q765186) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Even and odd pairs in linegraphs of bipartite graphs (Q1345522) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Finding an induced path that is not a shortest path (Q2032716) (← links)
- Detecting a long odd hole (Q2035985) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- Algorithmic Aspects of Monophonic Convexity (Q3503548) (← links)
- (Q4500707) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Finding an induced subdivision of a digraph (Q5891097) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)