"Complexity of approximation of 3-edge-coloring of graphs."

Martin Kochol et al. (2008)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2008.05.015

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/KocholKSS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/KocholKSS08
Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Complexity of approximation of 3-edge-coloring of graphs. Inf. Process. Lett. 108(4): 238-241 (2008)

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.