"Bounds and complexity results for strong edge colouring of subcubic graphs."

Hervé Hocquard, Pascal Ochem, Petru Valicov (2011)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2011.09.075

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/HocquardOV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/HocquardOV11
Hervé Hocquard, Pascal Ochem, Petru Valicov:
Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. 38: 463-468 (2011)

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.