"A polynomial time algorithm for strong edge coloring of partial ..."

Mohammad R. Salavatipour (2004)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2004.03.001

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Salavatipour04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Salavatipour04
Mohammad R. Salavatipour:
A polynomial time algorithm for strong edge coloring of partial k-trees. Discret. Appl. Math. 143(1-3): 285-291 (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.