Pages that link to "Item:Q1175980"
From MaRDI portal
The following pages link to On the complexity of testing for odd holes and induced odd paths (Q1175980):
Displayed 50 items.
- The three-in-a-tree problem (Q653792) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Finding induced trees (Q967418) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- Path parity and perfection (Q1356748) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- A polynomial algorithm for the parity path problem on perfectly orientable graphs (Q1917257) (← links)
- The parity path problem on some subclasses of perfect graphs (Q1923620) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Detecting a long odd hole (Q2035985) (← links)
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded (Q2094868) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Attachment centrality: measure for connectivity in networks (Q2321314) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Recognizing binet matrices (Q2638382) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- (Q4500707) (← links)
- (Q5091002) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- (Q5743428) (← links)
- (Q5743476) (← links)
- Finding an induced subdivision of a digraph (Q5891097) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- Recognition of quasi-Meyniel graphs (Q5951967) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Perfect forests in graphs and their extensions (Q6057643) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q6166893) (← links)