Corrigendum to: On the complexity of testing for odd holes and induced odd paths
From MaRDI portal
Publication:1193442
DOI10.1016/0012-365X(92)90357-LzbMath0760.05080OpenAlexW4210316907MaRDI QIDQ1193442
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90357-l
Related Items (20)
Chordless paths through three vertices ⋮ Induced disjoint paths in circular-arc graphs in linear time ⋮ Even and odd pairs in linegraphs of bipartite graphs ⋮ Detecting induced star-like minors in polynomial time ⋮ The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ Finding a shortest even hole in polynomial time ⋮ Algorithmic Aspects of Monophonic Convexity ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Finding an induced subdivision of a digraph ⋮ The (theta, wheel)-free graphs. IV: Induced paths and cycles ⋮ Unnamed Item ⋮ Detecting induced subgraphs ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Finding an induced path that is not a shortest path ⋮ Detecting a long odd hole ⋮ Induced disjoint paths in AT-free graphs ⋮ Clique or hole in claw-free graphs ⋮ Efficient reduction for path problems on circular-arc graphs ⋮ A faster algorithm to recognize even-hole-free graphs
This page was built for publication: Corrigendum to: On the complexity of testing for odd holes and induced odd paths
