Amazon.com: Handbook of Graph Theory (Discrete Mathematics and Its Applications) (9781584880905): Jonathan L. Gross, Jay Yellen: Books
Handbook of Graph Theory and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
Kindle Edition
 
   
Sell Back Your Copy
For a $4.74 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Handbook of Graph Theory (Discrete Mathematics and Its Applications)
 
 
Start reading Handbook of Graph Theory on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Handbook of Graph Theory (Discrete Mathematics and Its Applications) [Hardcover]

Jonathan L. Gross (Editor), Jay Yellen (Editor)
3.5 out of 5 stars  See all reviews (2 customer reviews)

List Price: $139.95
Price: $101.30 & this item ships for FREE with Super Saver Shipping. Details
You Save: $38.65 (28%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Usually ships within 1 to 3 weeks.
Ships from and sold by Amazon.com. Gift-wrap available.
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $67.99  
Hardcover $101.30  
There is a newer edition of this item:
Handbook of Graph Theory Handbook of Graph Theory
Sign up to be notified when this item becomes available.

Book Description

December 29, 2003 1584880902 978-1584880905 1
The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as well as "pure" graph theory. They then carefully edited the compilation to produce a unified, authoritative work ideal for ready reference.

Designed and edited with non-experts in mind, the Handbook of Graph Theory makes information easy to find and easy to understand. The treatment of each topic includes lists of essential definitions and facts accompanied by examples, tables, remarks, and in some areas, conjectures and open problems. Each section contains a glossary of terms relevant to that topic and an extensive bibliography of references that collectively form an extensive guide to the primary research literature.

The applications of graph theory are fast becoming ubiquitous. Whether your primary area of interest lies in mathematics, computer science, engineering, or operations research, this handbook holds the key to unlocking graph theory's intricacies, applications, and potential.

Customers Who Bought This Item Also Bought


Product Details

  • Hardcover: 1192 pages
  • Publisher: CRC Press; 1 edition (December 29, 2003)
  • Language: English
  • ISBN-10: 1584880902
  • ISBN-13: 978-1584880905
  • Product Dimensions: 10.2 x 7.1 x 2.8 inches
  • Shipping Weight: 4.4 pounds (View shipping rates and policies)
  • Average Customer Review: 3.5 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #699,851 in Books (See Top 100 in Books)

 

Customer Reviews

2 Reviews
5 star:    (0)
4 star:
 (1)
3 star:
 (1)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
3.5 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

9 of 9 people found the following review helpful:
4.0 out of 5 stars Comprehensive supplementary reference, October 27, 2005
By 
Nathan Oakes (Ashland, Oregon) - See all my reviews
This review is from: Handbook of Graph Theory (Discrete Mathematics and Its Applications) (Hardcover)
Don't try to learn anything for the first time from this. In each of the book's 54 sections, information is delivered as bulleted lists of definitions and theorems (called "facts") and there are extensive references to the literature. To maximize brevity, there is seldom any narrative introduction and only a few brief examples. No proofs, just references to them.

I noted two significant gaps in coverage. Since the main application of graph theory is in computer science, much of the Handbook relates to that field, yet there is no chapter on computational complexity. The other absent topic is scale-free graphs.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


8 of 10 people found the following review helpful:
3.0 out of 5 stars Nothing more than a handbook, February 11, 2004
By 
Steve Uhlig (Berlin, Germany) - See all my reviews
(REAL NAME)   
This review is from: Handbook of Graph Theory (Discrete Mathematics and Its Applications) (Hardcover)
As the title indicates, this is not a textbook, but a handbook. The interest of this one is to have pointers to the literature and to cover as much as possible of graph theory, so don't expect to find much details about something particular. I don't think it's useful for anything else than having a "close to hand" access to most of graph theory, hence only three stars for this limited interest compared to the relatively high price.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
Configurations of nodes and connections occur in a great diversity of applications. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
mixed hypergraph, additive bandwidth, crosscap number, imbedded graph, irreducible triangulations, capacity function cap, graph imbedding, symmetric genus, maximum genus, orientable imbeddings, set reconstructible, polygonal complex, cellular imbedding, bandwidth numbering, cutset subspace, removable cycle, triangular imbedding, average genus, tournament matrix, hamiltonian decomposable, polyhedral map, digraph whose underlying graph, graph encoded map, graph perfection, imbedding distributions
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, Theory Ser, Lecture Notes, London Math, New York, Academic Press, Cambridge University Press, Discrete Appl, Congressus Numerantium, Graphs Combin, Ars Combinatoria, Automated Timetabling, John Wiley, Theory of Computing, Columbia University, Georgia Institute of Technology, Perfect Graph Theorem, Four Color Theorem, Random Structures Algorithms, Studia Sci, First Edition, Kluwer Academic Publishers, Discrete Algorithms, Handbook of Combinatorics, Map Color Theorem
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:

Citations (learn more)
This book cites 43 books:
See all 43 books this book cites
 
28 books cite this book:
See all 28 books citing this book



What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!

Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject