A General Framework for Coloring Problems: Old Results, New Results, and Open Problems

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

6 Citations (Scopus)

Abstract

n 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
Title of host publicationCombinatorial Geometry and Graph Theory
Subtitle of host publicationIndonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers
EditorsJin Akiyama, Edy Tri Baskoro, Mikio Kano
Place of PublicationBerlin
PublisherSpringer
Pages65-79
Number of pages14
ISBN (Electronic)978-3-540-30540-8
ISBN (Print)978-3-540-24401-1
DOIs
Publication statusPublished - 2005
EventIndonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003 - Bandung, Indonesia
Duration: 13 Sep 200316 Sep 2003

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3330
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceIndonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003
Abbreviated titleIJCCGGT
CountryIndonesia
CityBandung
Period13/09/0316/09/03

Keywords

  • Graph coloring
  • Graph partitioning
  • Forbidden subgraph
  • Planar graph
  • Computational complexity

Fingerprint 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.

  • Cite this

    Broersma, H. (2005). A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. In J. Akiyama, E. T. Baskoro, & M. Kano (Eds.), Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers (pp. 65-79). (Lecture Notes in Computer Science; Vol. 3330). Berlin: Springer. https://doi.org/10.1007/978-3-540-30540-8_7