2013Unpublished venueRequires access

Graph Coloring Problems

D. de Werra, Daniel Kobler

Open publisher page 4 citations

Abstract

This chapter contains sections titled: Basic notions of colorings Complexity of coloring Sequential methods of coloring An exact coloring algorithm Tabu search Perfect graphs Chromatic scheduling Interval coloring T-colorings List colorings Coloring with cardinality constraints Other extensions Edge coloring Conclusion Bibliography

About this research paper

What this paper is about

This chapter contains sections titled: Basic notions of colorings Complexity of coloring Sequential methods of coloring An exact coloring algorithm Tabu search Perfect graphs Chromatic scheduling Interval coloring T-colorings List colorings Coloring with cardinality constraints Other extensions Edge coloring Conclusion Bibliography

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter contains sections titled: Basic notions of colorings Complexity of coloring Sequential methods of coloring An exact coloring algorithm Tabu search Perfect graphs Chromatic scheduling Interval coloring T-colorings List colorings Coloring with cardinality constraints Other extensions Edge coloring Conclusion Bibliography

Key concepts: Greedy coloring, Edge coloring, Graph coloring, Complete coloring, List coloring, Fractional coloring, Brooks' theorem, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Graph Coloring Problems — Research Paper | ScholarLens