"Every 4-Connected Graph with Crossing Number 2 is Hamiltonian."

Kenta Ozeki, Carol T. Zamfirescu (2018)

> Home

Details and statistics

DOI: 10.1137/17M1138443

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/OzekiZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/OzekiZ18
Kenta Ozeki, Carol T. Zamfirescu:
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian. SIAM J. Discret. Math. 32(4): 2783-2794 (2018)

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.