Graph Coloring Problems
D. de Werra, Daniel Kobler
Abstract
D. de Werra, Daniel Kobler
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
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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