"NP Completeness of Finding the Chromatic Index of Regular Graphs."

Daniel Leven, Zvi Galil (1983)

> Home

Details and statistics

DOI: 10.1016/0196-6774(83)90032-9

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/LevenG83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/LevenG83
Daniel Leven, Zvi Galil:
NP Completeness of Finding the Chromatic Index of Regular Graphs. J. Algorithms 4(1): 35-44 (1983)

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.