"Optimal partition of a bipartite graph into non-crossing matchings."

Federico Malucelli, Sara Nicoloso (2001)

> Home

Details and statistics

DOI: 10.1016/S1571-0653(04)00390-7

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/MalucelliN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/MalucelliN01
Federico Malucelli, Sara Nicoloso:
Optimal partition of a bipartite graph into non-crossing matchings. Electron. Notes Discret. Math. 10: 187-191 (2001)

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.