default search action

combined dblp search
author search
venue search
publication search

ask others

"Checking the admissibility of odd-vertex pairings is hard."

Florian Hörsch (2022)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2022.04.004

access: closed

type: Journal Article

metadata version: 2022-06-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/Horsch22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Horsch22
Florian Hörsch:
Checking the admissibility of odd-vertex pairings is hard. Discret. Appl. Math. 317: 42-48 (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.