"The complexity of list edge-partitions for simple graphs."

Payam Valadkhan (2017)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2016.11.006

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/Valadkhan17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/Valadkhan17
Payam Valadkhan:
The complexity of list edge-partitions for simple graphs. Eur. J. Comb. 61: 219-234 (2017)

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.