A general framework for coloring problems: Old results, New results, and open problems

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this survey paper we present a general framework for coloring problems that was introduced in a joint paper which the author presented at WG2003. We show how a number of different types of coloring problems, most of which have been motivated from frequency assignment, fit into this framework. We give a survey of the existing results, mainly based on and strongly biased by joint work of the author with several different groups of coauthors, include some new results, and discuss several open problems for each of the variants. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Broersma, H. (2005). A general framework for coloring problems: Old results, New results, and open problems. In Lecture Notes in Computer Science (Vol. 3330, pp. 65–79). Springer Verlag. https://doi.org/10.1007/978-3-540-30540-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free