"On finding two-connected subgraphs in planar graphs."

J. Scott Provan (1997)

> Home

Details and statistics

DOI: 10.1016/S0167-6377(96)00046-6

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Provan97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Provan97
J. Scott Provan:
On finding two-connected subgraphs in planar graphs. Oper. Res. Lett. 20(2): 81-84 (1997)

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.