"Hamilton completion and the path cover number of sparse random graphs."

Yahav Alon, Michael Krivelevich (2024)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2024.103934

access: closed

type: Journal Article

metadata version: 2024-08-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/AlonK24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/AlonK24
Yahav Alon, Michael Krivelevich:
Hamilton completion and the path cover number of sparse random graphs. Eur. J. Comb. 118: 103934 (2024)

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.