Graph Theory and Its Applications
Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come.
The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine.
What else is new?
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
O que estão dizendo - Escrever uma resenha
Não encontramos nenhuma resenha nos lugares comuns.
Chapter 2 STRUCTURE AND REPRESENTATION
Chapter 3 TREES
Chapter 4 SPANNING TREES
Chapter 5 CONNECTIVITY
Chapter 6 OPTIMAL GRAPH TRAVERSALS
Chapter 7 PLANARITY AND KURATOWSKIS THEOREM
Chapter 8 DRAWING GRAPHS AND MAPS
Chapter 12 SPECIAL DIGRAPH MODELS
Chapter 13 NETWORK FLOWS AND APPLICATIONS
Chapter 14 GRAPHICAL ENUMERATION
Chapter 15 ALGEBRAIC SPECIFICATION OF GRAPHS
Chapter 16 NONPLANAR LAYOUTS
SOLUTIONS AND HINTS
Outras edições - Visualizar todos
2-connected acyclic adjacent algorithm appendage Application assigned automorphism bijection binary bipartite graph Cayley graph Chapter circulant graph colors complete bipartite graph complete graph components connected graph construction contains Corollary corresponding cut-vertex cycle cycle graph DEFINITION degree deleting denoted depth-first depth-first search digraph directed disjoint drawing edge-coloring edge-connectivity edge-cut edge-set endpoints eulerian Example EXERCISES for Section Figure flow graph G graph graph graph of Exercise Graph Theory hamiltonian imbedding induced integers intersection graph isomorphism iteration labeled Lemma length Let G linear Markov matching matrix maximum minimum n-vertex non-adjacent non-tree number of edges pair path permutation Petersen graph planar problem Proof Proposition Prove result rooted rotation self-loops sequence shown shows simple graph spanning specified subgraph subset subtree Suppose surface TERMINOLOGY Theorem topological tour tournament trail traversal tree Tree-Growing vertex vertex-coloring vertex-connectivity vertex-set vertices voltage voltage graph walk