Graph Coloring

From Games to Deterministic and Quantum Approaches

By: Maurice Clerc

Write A Review

Paperback | 19 July 2026 | Edition Number 1

At a Glance

Paperback
146 Pages

Dimensions(cm)
25.4 x 17.8 x 0.79

Paperback

RRP $252.00

$187.75

25%OFF

or 4 interest-free payments of $46.94 with

Ships in 5 to 10 business days

This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications.

The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.