• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Graph Coloring Problems

Graph Coloring Problems

Paperback

Series: Wiley Discrete Mathematics and Optimization

General Mathematics

ISBN10: 0471028657
ISBN13: 9780471028659
Publisher: Wiley-Interscience
Published: Jan 18 1995
Pages: 320
Weight: 1.08
Height: 0.82 Width: 6.08 Depth: 9.20
Language: English
The field of graph colouring is an area of discrete mathematics which gives operation research scientists the ability to classify components of a set within given constraints which are generated as a graph. By identifying more than 200 unsolved problems, this text shows a central aspect of discrete mathematics in a new perspective and creates challenges for its readers. Information is also provided on related results and the reference literature.

Also in

General Mathematics