"Crossing matchings and circuits have maximal length."

Yaakov S. Kupitz et al. (2020)

> Home

Details and statistics

DOI: 10.1002/JGT.22512

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/KupitzLMPP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/KupitzLMPP20
Yaakov S. Kupitz, Hagit Last, Horst Martini, Micha A. Perles, Rom Pinchasi:
Crossing matchings and circuits have maximal length. J. Graph Theory 94(1): 159-169 (2020)

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.