Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

Voted

CIAC
2010
Springer

197views Algorithms» more CIAC 2010»

Strategic Coloring of a Graph

15 years 7 months ago

Strategic Coloring of a Graph

Download www.lamsade.dauphine.fr

Bruno Escoffier, Laurent Gourves, Jerome Monnot

Real-time Traffic

CIAC 2010 |

claim paper

Related Content

» Graph uniquemaximum and conflictfree colorings

» On the Acyclic Chromatic Number of Hamming Graphs

» Multiagent Graph Coloring Pareto Efficiency Fairness and Individual Rationality

» Colored graphs without colorful cycles

» Interval Total Colorings of Bipartite Graphs

» A BranchandCut algorithm for graph coloring

» Greedy defining sets in graphs and Latin squares

» Strong Colorings of Hypergraphs

» The harmonious coloring problem is NPcomplete for interval and permutation graphs

Post Info
More Details (n/a)

Added	17 Jul 2010
Updated	17 Jul 2010
Type	Conference
Year	2010
Where	CIAC
Authors	Bruno Escoffier, Laurent Gourves, Jerome Monnot

Comments (0)