"On the complexity of testing for odd holes and induced odd paths."

Daniel Bienstock (1991)

> Home

Details and statistics

DOI: 10.1016/0012-365X(91)90098-M

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Bienstock91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Bienstock91
Daniel Bienstock:
On the complexity of testing for odd holes and induced odd paths. Discret. Math. 90(1): 85-92 (1991)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.