On the complexity of testing for odd holes and induced odd paths
From MaRDI portal
Recommendations
Cites work
Cited in
(56)- A counterexample to the coarse Menger conjecture
- Few induced disjoint paths for \(H\)-free graphs
- A linear algorithm for the group path problem on chordal graphs
- Few induced disjoint paths for \(H\)-free graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- A faster algorithm for finding minimum Tucker submatrices
- Path parity and perfection
- Finding a shortest even hole in polynomial time
- Recognition of quasi-Meyniel graphs
- Exact Solution Algorithms for the Chordless Cycle Problem
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- FPT and kernelization algorithms for the induced tree problem
- Even and odd pairs in comparability and in P₄-comparability graphs
- Polyhedral properties of the induced cluster subgraphs
- The Induced Disjoint Paths Problem
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- On the mixed set covering, packing and partitioning polytope
- Odd paths, cycles, and T-joins: connections and algorithms
- scientific article; zbMATH DE number 1496606 (Why is no real title available?)
- MIP formulations for induced graph optimization problems: a tutorial
- One-three join: a graph operation and its consequences
- The parity path problem on some subclasses of perfect graphs
- Detecting a long odd hole
- A faster algorithm to recognize even-hole-free graphs
- Induced packing of odd cycles in planar graphs
- The four-in-a-tree problem in triangle-free graphs
- Deciding the closure of inconsistent rooted triples is NP-complete
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Finding an induced path of given parity in planar graphs in polynomial time
- The three-in-a-tree problem
- Decomposing Berge graphs and detecting balanced skew partitions
- Induced disjoint paths in claw-free graphs
- Graphs of large chromatic number
- Clique or hole in claw-free graphs
- Perfect forests in graphs and their extensions
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Even-hole-free graphs. I: Decomposition theorem
- Chordless paths through three vertices
- Attachment centrality: measure for connectivity in networks
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs
- A Menger-type theorem for two induced paths
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Induced disjoint paths problem in a planar digraph
- Algorithms for finding an induced cycle in planar graphs
- The \(k\)-in-a-path problem for claw-free graphs
- Large Induced Subgraphs via Triangulations and CMSO
- Finding induced trees
- Odd holes in bull-free graphs
- Recognizing binet matrices
- Contractions in perfect graphs
- A faster algorithm to recognize even-hole-free graphs
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
- Even-hole-free graphs part II: Recognition algorithm
- Finding induced paths of given parity in claw-free graphs
This page was built for publication: On the complexity of testing for odd holes and induced odd paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175980)
