📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Approximation and Hardness Results for the Maximum Edge q-coloring Problem

First Author: Adamaszek A

Attributed to: The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-17514-5_12

Publication URI: http://dx.doi.org/10.1007/978-3-642-17514-5_12

Type: Book Chapter

Book Title: Algorithms and Computation (2010)

Page Reference: 132-143

ISSN: 03029743 16113349