Corrigendum to: On the complexity of testing for odd holes and induced odd paths

DOI10.1016/0012-365X(92)90357-LMaRDI QIDQ1193442zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Review text

This corrigendum concerns the author's paper ibid. 90, No. 1, 85-92 (1991; Zbl 0753.05046).

Cited in

(17)

• Even and odd pairs in linegraphs of bipartite graphs
• Polyhedral properties of the induced cluster subgraphs
• Finding an induced path that is not a shortest path
• Detecting a long odd hole
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• The (theta, wheel)-free graphs. IV: Induced paths and cycles
• A faster algorithm to recognize even-hole-free graphs
• Detecting induced star-like minors in polynomial time
• Induced disjoint paths in circular-arc graphs in linear time
• Algorithmic Aspects of Monophonic Convexity
• scientific article; zbMATH DE number 1496606 (Why is no real title available?)
• Exact Solution Algorithms for the Chordless Cycle Problem
• Induced disjoint paths in claw-free graphs
• Finding a shortest even hole in polynomial time
• Clique or hole in claw-free graphs
• Efficient reduction for path problems on circular-arc graphs
• Chordless paths through three vertices

This page was built for publication: Corrigendum to: 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 Q1193442)