A general framework for coloring problems: old results, new results, and open problems

Research output: Book/ReportReportOther research output

87 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages14
Publication statusPublished - 2003

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-05C85
  • MSC-05C15
  • MSC-05C17
  • Graph coloring
  • Graph partitioning
  • Forbidden subgraph
  • Planar graph
  • Computational complexity


Dive into the research topics of 'A general framework for coloring problems: old results, new results, and open problems'. Together they form a unique fingerprint.
  • A General Framework for Coloring Problems: Old Results, New Results, and Open Problems

    Broersma, H., 2005, Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Akiyama, J., Baskoro, E. T. & Kano, M. (eds.). Berlin: Springer, p. 65-79 14 p. (Lecture Notes in Computer Science; vol. 3330).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    6 Citations (Scopus)

Cite this