Restricted colorings of graphs

Noga AlonCambridge 1993 · DOI · OpenAlex

Abstract

The problem of properly coloring the vertices (or edges) of a graph using for each vertex (or edge) a color from a prescribed list of permissible colors, received a considerable amount of attention. Here we describe the techniques applied in the study of this subject, which combine combinatorial, algebraic and probabilistic methods, and discuss several intriguing conjectures and open problems. This is mainly a survey of recent and less recent results in the area, but it contains several new results as well.
BibTeX
@inproceedings{alon1993restricted,
  author = {Noga Alon},
  title = {{Restricted colorings of graphs}},
  booktitle = {Cambridge},
  year = {1993},
  doi = {10.1017/cbo9780511662089.002},
}

Loading related content...

Figure