"String graphs. II. recognizing string graphs is NP-hard."

Jan Kratochvíl (1991)

> Home

Details and statistics

DOI: 10.1016/0095-8956(91)90091-W

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/Kratochvil91a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Kratochvil91a
Jan Kratochvíl:
String graphs. II. recognizing string graphs is NP-hard. J. Comb. Theory B 52(1): 67-78 (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.