Detecting even holes
From MaRDI portal
Publication:4667791
Recommendations
Cited in
(21)- Finding a shortest even hole in polynomial time
- On the structure of (even hole, kite)-free graphs
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Hole and antihole detection in graphs
- The Induced Disjoint Paths Problem
- Detecting holes and antiholes in graphs
- The parameterized complexity of k-edge induced subgraphs
- Detecting a long even hole
- Shortest odd paths in undirected graphs with conservative weight functions
- A faster algorithm to recognize even-hole-free graphs
- Induced packing of odd cycles in planar graphs
- Some completion problems for graphs without chordless cycles of prescribed lengths
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- On the forbidden induced subgraph sandwich problem
- Algorithms for finding an induced cycle in planar graphs
- The \(k\)-in-a-path problem for claw-free graphs
- On the structure of (pan, even hole)-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Detecting an Odd Hole
- Bisimplicial vertices in even-hole-free graphs
- Finding induced paths of given parity in claw-free graphs
This page was built for publication: Detecting even holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667791)