Discover products with sustainability features this Earth month
Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows.
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

  • Graph Coloring Problems (Wiley Series in Discrete Mathematics and Optimization)

Follow the author

Get new release updates & improved recommendations
Tommy R. Jensen
Follow
Something went wrong. Please try your request again later.

Graph Coloring Problems (Wiley Series in Discrete Mathematics and Optimization) 1st Edition

by Tommy R. Jensen (Author), Bjarne Toft (Author)
{"desktop_buybox_group_1":[{"displayPrice":"$185.49","priceAmount":185.49,"currencySymbol":"$","integerValue":"185","decimalSeparator":".","fractionalValue":"49","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"VdfDAuL7y9S8PNoxeta9wvpE29y3R2sZz5xqQ5XM%2BNdbV%2F9Rjyy3AqPWBepeiarWLLEyE%2FX%2FwkCYJNakkNuUXRaLpGuOwlE3CKC3g4K0iq6u1vhoxTU6geRPjSIcWKxSWMlfKM4Ha14%3D","locale":"en-US","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}

Purchase options and add-ons

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Read more
Previous slide of product details
  1. ISBN-10
    0471028657
  2. ISBN-13
    978-0471028659
  3. Edition
    1st
  4. Publisher
    Wiley-Interscience
  5. Publication date
    January 18, 1995
  6. Language
    English
  7. Dimensions
    5.94 x 0.79 x 9.13 inches
  8. Print length
    320 pages
Next slide of product details

Similar items that may deliver to you quickly

Page 1 of 1 Start over
Previous set of slides
  1. Random Graphs (Wiley Series in Discrete Mathematics and Optimization)
    Svante Janson
     
    Hardcover
    $195.95
    Get it as soon as Monday, Apr 20
    FREE Shipping by Amazon
    Only 1 left in stock (more on the way).
  2. Combinatorics and Finite Geometry (Springer Undergraduate Mathematics Series)
    Steven T. Dougherty
     
    Paperback
    $37.99
    Get it as soon as Thursday, Apr 16
    FREE Shipping by Amazon
  3. Topological Graph Theory (Dover Books on Mathematics)
    Jonathan L. Gross
     
    Paperback
    $16.95
    Get it as soon as Thursday, Apr 16
    FREE Shipping on orders over $35 shipped by Amazon
    Only 9 left in stock (more on the way).
  4. Extremal Graph Theory (Dover Books on Mathematics)
    Bela Bollobas
     
    Paperback
    $11.23
    Get it as soon as Thursday, Apr 16
    FREE Shipping on orders over $35 shipped by Amazon
    Only 3 left in stock (more on the way).
  5. Geometry and Topology
    Miles Reid
     
    Paperback
    $93.00
    Get it as soon as Thursday, Apr 16
    FREE Shipping by Amazon
  6. Quadratics (Discrete Mathematics and Its Applications)
    Richard A. Mollin
    Hardcover
    $179.96
    Get it as soon as Thursday, Apr 16
    FREE Shipping by Amazon
    Only 1 left in stock - order soon.
Next set of slides

Editorial Reviews

From the Publisher

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.

About the Author

Tommy R. Jensen and Bjarne Toft are the authors of Graph Coloring Problems, published by Wiley.

Product details

About the author

Follow authors to get new release updates, plus improved recommendations.
Tommy R. Jensen

Tommy R. Jensen

Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Related books

Page 1 of 1Start Over
Sponsored
Previous page
  1. Shop the Store on Amazon ›
    Node.js Design Patterns: Level up your Node.js skills and design production-grade applications using proven techniques
    Node.js Design Patterns: Level up your Node.js skills and design production-grade applications using proven techniques
    4.94.9 out of 5 stars25
    20% offLimited time deal
    $43.99 List:$54.99
  2. Shop the Store on Amazon ›
    GED Math Study Cards 2026-2027: GED Math Test Prep and Practice Test Questions [Full Color Cards]
    GED Math Study Cards 2026-2027: GED Math Test Prep and Practice Test Questions [Full Color Cards]
    4.44.4 out of 5 stars16
    $29.99 List:$34.99
  3. Shop the Store on Amazon ›
    New York State Test Prep Grade 5 - English & Mathematics: A Complete Practice Workbook with 10 Full-Length Tests
    New York State Test Prep Grade 5 - English & Mathematics: A Complete Practice Workbook with 10 Full-Length Tests
    4.74.7 out of 5 stars5
    $29.97
  4. Shop the Store on Amazon ›
    Preschool Math Workbook for Toddlers Ages 3-4: Number Tracing, Counting, Shapes, Practice Addition and Subtraction, More Less Fewer exercises. (Mathematics Practice Workbooks)
    Preschool Math Workbook for Toddlers Ages 3-4: Number Tracing, Counting, Shapes, Practice Addition and Subtraction, More Less Fewer exercises. (Mathematics Practice Workbooks)
    4.24.2 out of 5 stars28
    $11.99
  5. Shop the Store on Amazon ›
    Strategic Problem Solving: A Step-by-Step Guide to Solve Hard Problems: Leverage Data Analysis and Critical Thinking to Make Smart Decisions, Drive Innovation, and Lead with Confidence
    Strategic Problem Solving: A Step-by-Step Guide to Solve Hard Problems: Leverage Data Analysis and Critical Thinking to Make Smart Decisions, Drive Innovation, and Lead with Confidence
    4.54.5 out of 5 stars391
    $17.99
Next page

Customer reviews

5 out of 5 stars
3 global ratings

Top reviews from the United States

  • A. Assarpour
    5.0 out of 5 stars As advertised
    Reviewed in the United States on November 20, 2014
    Format: PaperbackVerified Purchase
    Does what it's supposed to.
    Helpful
     Report
  • James Arvo
    5.0 out of 5 stars A concise catalog of theorems and conjectures.
    Reviewed in the United States on July 14, 2003
    Format: Paperback
    This is a highly technical book that gathers together in one medium-sized volume (less than 300 pages) hundreds of new and classical theorems and conjectures on every conceivable type of graph coloring problem. It is primarily a mathematical treatment in Theorem-Proof style, although the proofs are left to the references (otherwise the book would have been enormous). The book consists of many short sections, each one often less than a page, formally stating a theorem or a conjecture, then briefly summarizing what is known about it, and where the results have been published. As the authors state in the preface, "We did not intend to write a textbook to be read from beginning to end, but rather a catalog suitable for browsing". It seems they have achieved what was intended; it's quite interesting to simply browse through this book.
    To give you an idea of the level of the discussion in the text, here is an excerpt from page 1: After a terse definition of vertex coloring and "chromatic number", the authors state that "The existence of the chromatic number follows from the Well-Ordering Theorem of set theory... However, even if it is not assumed that every set has a well-ordering, but maintaining the property that every set has a cardinality, then the statement 'Any finite or infinite graph has a chromatic number' is equivalent to the Axiom of Choice...". If you are unfamiliar with concepts such as well-ordering or the axiom of choice, such a discussion will be of little value to you. However, if you are familiar with these ideas, you will appreciate how quickly the authors jump into meaty discussions. As another example, the chapter on planar graphs begins with a number of excellent questions: "Does there exist a short proof of the four-color theorem...?", "Is there a short argument to demonstrate that the four-color problem is a finite problem?", and "Is there a short argument that proves the existence of a polynomial algorithm to decide if a given planar graph if 4-colorable?", to mention three. The chapter then proceeds to discuss what is currently know about these problems, and many others.
    I suspect that the book would be of great interest not only to mathematicians but also computer scientists, as there are numerous discussions/problems on computational complexity. For example, "Does there exist a function g and a polynomial algorithm that for any given input graph G will find a number s, such that the chromatic number of G satisfies s <= X(G) <= g(s)?" (Here X(G) is the chromatic number of graph G.) The authors state that the question was answered affirmatively by Alon in 1993 if X(G) is replaced by "list-chromatic number". This is typical of the problems cataloged in this book: a terse but formally correct statement of a problem followed by what is currently know, with full citations.

    The bibliography at the end of each section is extensive, if not daunting, so there should be little problem looking up all relevant literature concerning a given problem. The authors have also set up an on-line archive for up-to-the-minute research results on these problems. This is an excellent reference for those who are interested in serious research in graph coloring. I would not recommend it to undergraduates in computer science or mathematics, nor to those seeking accessible discussions of classic graph algorithms; this is not an introductory text.
    16 people found this helpful
    Helpful
     Report