"A note on the complexity of longest path problems related to graph coloring."

Panos M. Pardalos, Athanasios Migdalas (2004)

> Home

Details and statistics

DOI: 10.1016/S0893-9659(04)90003-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/appml/PardalosM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/appml/PardalosM04
Panos M. Pardalos, Athanasios Migdalas:
A note on the complexity of longest path problems related to graph coloring. Appl. Math. Lett. 17(1): 13-15 (2004)

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.