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

Authors:
Hajo Broersma
Affiliations:
Department of Applied Mathematics, Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands
Venue:
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Year:
2003

Citing 15
Cited 2

Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
The traveling salesman problem with distances one and two

Mathematics of Operations Research
Labeling Chordal Graphs: Distance Two Condition

SIAM Journal on Discrete Mathematics
The $L(2,1)$-Labeling Problem on Graphs

SIAM Journal on Discrete Mathematics
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Coloring powers of planar graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fixed parameter complexity of λ-labelings

Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Distance Constrained Labeling of Precolored Trees

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
lambda-Coloring of Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Radio Labeling with Pre-assigned Frequencies

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Online and Offline Distance Constrained Labeling of Disk Graphs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Graph labeling and radio channel assignment

Journal of Graph Theory
An explicit lower bound for TSP with distances one and two

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

The distant-2 chromatic number of random proximity and random geometric graphs

Information Processing Letters
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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. AMS Subject Classifications: 05C15,05C85,05C17