Graph Theory

ISBN-10: 0486498069

ISBN-13: 9780486498065

Edition: 2012

Authors: Ronald Gould
List price: $27.00 Buy it from $11.80
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as mathematicians studying topology, algebra, and matrix theory.

Used Starting from $11.80
New Starting from $16.82
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $27.00
Copyright year: 2012
Publisher: Dover Publications, Incorporated
Publication date: 11/21/2012
Binding: Paperback
Pages: 352
Size: 6.00" wide x 9.00" long x 0.75" tall
Weight: 0.990

Graphs
Introduction
Fundamental Concepts and Notation
Elementary Properties and Operations
Alternate Representations for Graphs
Algorithms
Degree Sequences
Fundamental Counting
Paths and Searching
Distance
Connectivity
Digraph Connectivity
Problem Solving and Heuristics
Trees
Fundamental Properties of Trees
Minimal Weight Spanning Trees
Counting Trees
Directed Trees
Optimal Directed Subgraphs
Binary Trees
More About Counting-Using Generating Functions
Networks
Flows
The Ford and Fulkerson Approach
The Dinic Algorithm and Layered Networks
Layered Networks and Potential
Variations on Networks
Connectivity and Networks
Cycles and Circuits
Eulerian Graphs
Adjacency Conditions for Hamiltonian Graphs
Related Hamiltonian-like Properties
Forbidden Subgraphs
Other Types of Hamiltonian Results
The Traveling Salesman Problem
Short Cycles and Girth
Disjoint Cycles
Planarity
Euler's Formula
Characterizations of Planar Graphs
A Planarity Algorithm
The Hopcroft-Tarjan Planarity Algorithm
Hamiltonian Planar Graphs
Matchings
Introduction
Matchings and Bipartite Graphs
Matching Algorithms and Marriage
Factoring
Degrees and 2-Factors
Independence
Vertex Independence and Coverings
Vertex Colorings
Approximate Coloring Algorithms
Edge Colorings
The Four Color Theorem
Chromatic Polynomials
Perfect Graphs
Special Topics and Applications
Graphs and Ordered Sets
Random Graphs
Ramsey Theory
Finite State Machines
Scheduling
Tournaments
Extremal Theory
Introduction
Complete Subgraphs
Cycles in Graphs
On the Structure of Extremal Graphs
Appendix
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×