"A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense ..."

Viresh Patel, Fabian Stroh (2022)

> Home

Details and statistics

DOI: 10.1137/20M1356191

access: closed

type: Journal Article

metadata version: 2022-06-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/PatelS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/PatelS22
Viresh Patel, Fabian Stroh:
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. SIAM J. Discret. Math. 36(2): 1363-1393 (2022)

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.