"The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected ..."

Norishige Chiba, Takao Nishizeki (1989)

> Home

Details and statistics

DOI: 10.1016/0196-6774(89)90012-6

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/ChibaN89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/ChibaN89
Norishige Chiba, Takao Nishizeki:
The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. J. Algorithms 10(2): 187-211 (1989)

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.