Handbook of Graph Theory (Google eBook)
Jonathan L. Gross, Jay Yellen
CRC Press, Dec 29, 2003 - Mathematics - 1192 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
CONNECTIVITY and TRAVERSABILITY
COLORINGS and RELATED TOPICS
ALGEBRAIC GRAPH THEORY
ANALYTIC GRAPH THEORY
GRAPHS in COMPUTER SCIENCE
NETWORKS and FLOWS
2-connected adjacency matrix algorithm arcs automorphism bipartite graph Cayley graph chromatic number circuit clique closed surface coloring Combin Combinatorial complete graph components Comput conjecture connected graph contains cutset decomposition deﬁned deﬁnition DEFINITIONS deletion denoted depth-ﬁrst digraph digraph G directed graph Discrete Math edge-connectivity eigenvalues eulerian tour EXAMPLE exists FACTS Figure ﬁnd ﬁnite ﬁrst ﬁxed ﬂow given graph drawing graph G graph imbedding graph of order Graph Theory hamiltonian cycle heuristics hypergraph independent set induced subgraph inﬁnite integer interval graph isomorphic labeled Let G linear matroid maximum genus minimal minimum degree NOTATION number of edges number of vertices orientable pair partition permutation planar graph polynomial problem Proc Ramsey numbers random graph reconstruction regular graphs REMARKS rooted tree satisﬁes sequence simple graph spanning tree speciﬁed subset sufﬁcient symmetric theorem topological tournament transitive triangulation undirected vector vertex vertex set voltage graph
Page 37 - The puzzle is to lay on water, gas, and electricity, from W, G, and E, to each of the three houses, A, B, and C, without any pipe crossing another