"Embedding Graphs Having Ore-Degree at Most Five."

Béla Csaba, Judit Nagy-György (2019)

> Home

Details and statistics

DOI: 10.1137/17M1155442

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/CsabaN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CsabaN19
Béla Csaba, Judit Nagy-György:
Embedding Graphs Having Ore-Degree at Most Five. SIAM J. Discret. Math. 33(1): 474-508 (2019)

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.