"The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs ..."

Ján Plesník (1979)

> Home

Details and statistics

DOI: 10.1016/0020-0190(79)90023-1

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Plesnik79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Plesnik79
Ján Plesník:
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. Inf. Process. Lett. 8(4): 199-201 (1979)

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.