"Finding any given 2-factor in sparse pseudorandom graphs efficiently."

Jie Han et al. (2021)

> Home

Details and statistics

DOI: 10.1002/JGT.22576

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/HanKMP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/HanKMP21
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory 96(1): 87-108 (2021)

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.