Coloration de graphes : fondements et applications

DOI10.1051/ro:2003013zbMath1062.90026OpenAlexW2159161548MaRDI QIDQ4809665

Dominique de Werra, Daniel Kobler

Publication date: 30 August 2004

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_1_29_0

zbMATH Keywords

schedulingcolouring models

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded vertex colorings of graphs
• Topics on perfect graphs
• On the complexity of recognizing perfectly orderable graphs
• Some models of graphs for scheduling sports competitions
• Colorings and orientations of graphs
• Precoloring extension. I: Interval graphs
• A still better performance guarantee for approximate graph coloring
• Geometric algorithms and combinatorial optimization
• Some simplified NP-complete graph problems
• The combinatorics of timetabling
• On a multiconstrained model for chromatic scheduling
• On a graph-theoretical model for cyclic register allocation
• A sufficient condition for equitable edge-colourings of simple graphs
• Chromatic scheduling and frequency assignment
• Scheduling with incompatible jobs
• Mixed graph colorings
• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• Genetic and hybrid algorithms for graph coloring
• Scheduling File Transfers
• Consecutive colorings of graphs
• A graph coloring algorithm for large scheduling problems
• The Complexity of Near-Optimal Graph Coloring
• Graph colorings with local constraints -- a survey
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Coloration de graphes : fondements et applications